./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 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+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 17:58:44,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:58:44,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:58:44,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:58:44,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:58:44,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:58:44,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:58:44,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:58:44,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:58:44,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:58:44,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:58:44,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:58:44,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:58:44,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:58:44,388 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:58:44,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:58:44,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:58:44,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:58:44,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:58:44,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:58:44,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:58:44,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:58:44,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:58:44,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:58:44,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:58:44,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:58:44,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:58:44,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:58:44,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:58:44,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:58:44,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:58:44,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:58:44,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:58:44,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:58:44,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:58:44,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:58:44,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:58:44,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:58:44,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:58:44,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:58:44,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:58:44,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:58:44,403 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 17:58:44,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:58:44,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:58:44,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:58:44,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:58:44,776 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:58:44,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-12 17:58:46,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:58:46,624 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:58:46,625 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-12 17:58:46,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0a46b0a7e/ce0f94d5419d4516b6a2d32657a7ac33/FLAG2f932eec9 [2024-09-12 17:58:46,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0a46b0a7e/ce0f94d5419d4516b6a2d32657a7ac33 [2024-09-12 17:58:46,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:58:46,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:58:46,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:58:46,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:58:46,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:58:46,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:58:46" (1/1) ... [2024-09-12 17:58:46,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a29b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:46, skipping insertion in model container [2024-09-12 17:58:46,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:58:46" (1/1) ... [2024-09-12 17:58:47,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:58:47,214 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-12 17:58:47,220 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-12 17:58:47,225 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-12 17:58:47,232 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-12 17:58:47,235 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-12 17:58:47,238 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-12 17:58:47,242 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-12 17:58:47,244 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-12 17:58:47,247 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-12 17:58:47,250 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-12 17:58:47,252 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-12 17:58:47,253 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-12 17:58:47,255 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-12 17:58:47,257 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-12 17:58:47,258 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-12 17:58:47,259 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-12 17:58:47,260 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-12 17:58:47,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:58:47,277 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:58:47,293 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-12 17:58:47,296 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-12 17:58:47,302 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-12 17:58:47,303 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-12 17:58:47,304 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-12 17:58:47,310 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-12 17:58:47,311 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-12 17:58:47,312 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-12 17:58:47,316 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-12 17:58:47,317 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-12 17:58:47,323 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-12 17:58:47,324 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-12 17:58:47,326 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-12 17:58:47,332 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-12 17:58:47,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-12 17:58:47,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-12 17:58:47,341 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-12 17:58:47,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:58:47,370 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:58:47,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47 WrapperNode [2024-09-12 17:58:47,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:58:47,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:58:47,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:58:47,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:58:47,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,401 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:58:47,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:58:47,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:58:47,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:58:47,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:58:47,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,434 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-12 17:58:47,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:58:47,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:58:47,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:58:47,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:58:47,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (1/1) ... [2024-09-12 17:58:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:58:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:58:47,503 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-12 17:58:47,506 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-12 17:58:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:58:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:58:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:58:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:58:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:58:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:58:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:58:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:58:47,648 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:58:47,651 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:58:48,029 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-09-12 17:58:48,029 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:58:48,059 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:58:48,060 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 17:58:48,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:58:48 BoogieIcfgContainer [2024-09-12 17:58:48,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:58:48,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:58:48,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:58:48,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:58:48,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:58:46" (1/3) ... [2024-09-12 17:58:48,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418ea208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:58:48, skipping insertion in model container [2024-09-12 17:58:48,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:58:47" (2/3) ... [2024-09-12 17:58:48,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418ea208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:58:48, skipping insertion in model container [2024-09-12 17:58:48,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:58:48" (3/3) ... [2024-09-12 17:58:48,072 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2024-09-12 17:58:48,090 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:58:48,090 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-09-12 17:58:48,161 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:58:48,170 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;@688c9687, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:58:48,171 INFO L337 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-09-12 17:58:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.873015873015873) internal successors, (118), 90 states have internal predecessors, (118), 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-12 17:58:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-12 17:58:48,182 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:48,183 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:48,184 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:48,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash 11023328, now seen corresponding path program 1 times [2024-09-12 17:58:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986651738] [2024-09-12 17:58:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:48,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:48,417 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-12 17:58:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986651738] [2024-09-12 17:58:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986651738] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:58:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102655546] [2024-09-12 17:58:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:48,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:58:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:58:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:58:48,464 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.873015873015873) internal successors, (118), 90 states have internal predecessors, (118), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 17:58:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:48,744 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2024-09-12 17:58:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:58:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2024-09-12 17:58:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:48,759 INFO L225 Difference]: With dead ends: 101 [2024-09-12 17:58:48,760 INFO L226 Difference]: Without dead ends: 89 [2024-09-12 17:58:48,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:48,767 INFO L434 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:48,768 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 161 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-12 17:58:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-09-12 17:58:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.5) internal successors, (90), 85 states have internal predecessors, (90), 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-12 17:58:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-09-12 17:58:48,812 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 7 [2024-09-12 17:58:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:48,812 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-09-12 17:58:48,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 17:58:48,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-09-12 17:58:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:58:48,814 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:48,815 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:48,815 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:58:48,815 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:48,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 341723210, now seen corresponding path program 1 times [2024-09-12 17:58:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397131831] [2024-09-12 17:58:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:48,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:48,898 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-12 17:58:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397131831] [2024-09-12 17:58:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397131831] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:58:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710148886] [2024-09-12 17:58:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:48,901 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:58:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:58:48,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:58:48,902 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-12 17:58:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:49,080 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-09-12 17:58:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:58:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 8 [2024-09-12 17:58:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:49,082 INFO L225 Difference]: With dead ends: 89 [2024-09-12 17:58:49,082 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 17:58:49,082 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:49,083 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:49,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 78 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 17:58:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-12 17:58:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 84 states have internal predecessors, (89), 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-12 17:58:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-09-12 17:58:49,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 8 [2024-09-12 17:58:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:49,101 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-09-12 17:58:49,102 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-12 17:58:49,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-09-12 17:58:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 17:58:49,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:49,103 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:49,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:58:49,104 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1412733832, now seen corresponding path program 1 times [2024-09-12 17:58:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897069077] [2024-09-12 17:58:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:49,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:49,259 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-12 17:58:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897069077] [2024-09-12 17:58:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897069077] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:58:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328837816] [2024-09-12 17:58:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:49,261 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:58:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:58:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:49,262 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:58:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:49,481 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-09-12 17:58:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:58:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2024-09-12 17:58:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:49,483 INFO L225 Difference]: With dead ends: 88 [2024-09-12 17:58:49,484 INFO L226 Difference]: Without dead ends: 82 [2024-09-12 17:58:49,485 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:49,486 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:49,486 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 90 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-12 17:58:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-09-12 17:58:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 78 states have internal predecessors, (83), 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-12 17:58:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-09-12 17:58:49,509 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 13 [2024-09-12 17:58:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:49,509 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-09-12 17:58:49,510 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:58:49,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-09-12 17:58:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 17:58:49,515 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:49,515 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:49,515 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:58:49,515 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr20ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:49,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1416337546, now seen corresponding path program 1 times [2024-09-12 17:58:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502379798] [2024-09-12 17:58:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:49,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:49,687 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-12 17:58:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502379798] [2024-09-12 17:58:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502379798] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433835558] [2024-09-12 17:58:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:49,691 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:49,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:49,694 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 17:58:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:49,928 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-09-12 17:58:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2024-09-12 17:58:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:49,930 INFO L225 Difference]: With dead ends: 94 [2024-09-12 17:58:49,930 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 17:58:49,930 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:58:49,931 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:49,932 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 211 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 17:58:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-09-12 17:58:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 84 states have internal predecessors, (90), 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-12 17:58:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-09-12 17:58:49,955 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 13 [2024-09-12 17:58:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:49,955 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-09-12 17:58:49,956 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 17:58:49,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-09-12 17:58:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 17:58:49,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:49,957 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:49,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:58:49,957 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:49,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 845078901, now seen corresponding path program 1 times [2024-09-12 17:58:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769523741] [2024-09-12 17:58:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769523741] [2024-09-12 17:58:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769523741] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629233985] [2024-09-12 17:58:50,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:50,099 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:50,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:50,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:50,100 INFO L87 Difference]: Start difference. First operand 88 states and 93 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-12 17:58:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:50,266 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-09-12 17:58:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:50,266 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-12 17:58:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:50,267 INFO L225 Difference]: With dead ends: 90 [2024-09-12 17:58:50,268 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 17:58:50,268 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:58:50,269 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:50,269 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 171 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 17:58:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-12 17:58:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 84 states have internal predecessors, (89), 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-12 17:58:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-09-12 17:58:50,282 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2024-09-12 17:58:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:50,282 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-09-12 17:58:50,282 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-12 17:58:50,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-09-12 17:58:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:58:50,283 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:50,284 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-12 17:58:50,284 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:58:50,284 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:50,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1105164283, now seen corresponding path program 1 times [2024-09-12 17:58:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340893776] [2024-09-12 17:58:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,362 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-12 17:58:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340893776] [2024-09-12 17:58:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340893776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:50,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111865620] [2024-09-12 17:58:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:50,363 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:50,364 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:50,572 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-09-12 17:58:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:50,574 INFO L225 Difference]: With dead ends: 88 [2024-09-12 17:58:50,574 INFO L226 Difference]: Without dead ends: 86 [2024-09-12 17:58:50,575 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-12 17:58:50,577 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:50,577 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 123 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-12 17:58:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-12 17:58:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 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-12 17:58:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-09-12 17:58:50,599 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 18 [2024-09-12 17:58:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:50,599 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-09-12 17:58:50,600 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-09-12 17:58:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:58:50,601 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:50,601 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-12 17:58:50,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:58:50,601 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr23ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:50,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1331725937, now seen corresponding path program 1 times [2024-09-12 17:58:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027150442] [2024-09-12 17:58:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,704 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-12 17:58:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027150442] [2024-09-12 17:58:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027150442] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:50,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:50,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589060067] [2024-09-12 17:58:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:50,706 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:50,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:50,708 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:50,885 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-09-12 17:58:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:50,887 INFO L225 Difference]: With dead ends: 86 [2024-09-12 17:58:50,887 INFO L226 Difference]: Without dead ends: 84 [2024-09-12 17:58:50,887 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-12 17:58:50,888 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:50,888 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 117 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-12 17:58:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-12 17:58:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.328125) internal successors, (85), 80 states have internal predecessors, (85), 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-12 17:58:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-09-12 17:58:50,904 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 18 [2024-09-12 17:58:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:50,904 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-09-12 17:58:50,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 17:58:50,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-09-12 17:58:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:58:50,906 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:50,906 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-12 17:58:50,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:58:50,906 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:50,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash -99642506, now seen corresponding path program 1 times [2024-09-12 17:58:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:50,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036327210] [2024-09-12 17:58:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:50,997 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-12 17:58:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036327210] [2024-09-12 17:58:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036327210] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:50,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:50,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:58:50,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88882813] [2024-09-12 17:58:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:50,999 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:58:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:58:51,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:51,000 INFO L87 Difference]: Start difference. First operand 84 states and 88 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-12 17:58:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:51,125 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-09-12 17:58:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:58:51,126 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-12 17:58:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:51,127 INFO L225 Difference]: With dead ends: 84 [2024-09-12 17:58:51,127 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 17:58:51,127 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:51,128 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:51,128 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 17:58:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 17:58:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 76 states have internal predecessors, (81), 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-12 17:58:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-09-12 17:58:51,150 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-09-12 17:58:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:51,151 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-09-12 17:58:51,151 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-12 17:58:51,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-09-12 17:58:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:58:51,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:51,153 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-12 17:58:51,153 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:58:51,153 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr25ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:51,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1666602099, now seen corresponding path program 1 times [2024-09-12 17:58:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38111096] [2024-09-12 17:58:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,243 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-12 17:58:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38111096] [2024-09-12 17:58:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38111096] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:51,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946650544] [2024-09-12 17:58:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:51,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:51,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:51,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:51,247 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-12 17:58:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:51,424 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-09-12 17:58:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-12 17:58:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:51,425 INFO L225 Difference]: With dead ends: 80 [2024-09-12 17:58:51,425 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 17:58:51,426 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-12 17:58:51,426 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:51,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 103 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 17:58:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-12 17:58:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 74 states have internal predecessors, (79), 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-12 17:58:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-09-12 17:58:51,437 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 19 [2024-09-12 17:58:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:51,437 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-09-12 17:58:51,437 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-12 17:58:51,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-09-12 17:58:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:58:51,438 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:51,438 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-12 17:58:51,439 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:58:51,439 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:51,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1666172116, now seen corresponding path program 1 times [2024-09-12 17:58:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335795148] [2024-09-12 17:58:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,519 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-12 17:58:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:51,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335795148] [2024-09-12 17:58:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335795148] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:58:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274367073] [2024-09-12 17:58:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:51,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:58:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:58:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:51,522 INFO L87 Difference]: Start difference. First operand 78 states and 82 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-12 17:58:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:51,635 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-09-12 17:58:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:58:51,636 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-12 17:58:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:51,638 INFO L225 Difference]: With dead ends: 78 [2024-09-12 17:58:51,638 INFO L226 Difference]: Without dead ends: 74 [2024-09-12 17:58:51,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:51,639 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:51,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-12 17:58:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-09-12 17:58:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 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-12 17:58:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-09-12 17:58:51,652 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 19 [2024-09-12 17:58:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:51,653 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-09-12 17:58:51,653 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-12 17:58:51,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-09-12 17:58:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:58:51,654 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:51,654 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-12 17:58:51,654 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:58:51,655 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr18ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:51,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1222057421, now seen corresponding path program 1 times [2024-09-12 17:58:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584333818] [2024-09-12 17:58:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,727 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-12 17:58:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584333818] [2024-09-12 17:58:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584333818] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004856433] [2024-09-12 17:58:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:51,728 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:51,729 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:51,892 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-09-12 17:58:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:51,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:51,893 INFO L225 Difference]: With dead ends: 74 [2024-09-12 17:58:51,893 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 17:58:51,894 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-12 17:58:51,894 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:51,895 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 89 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 17:58:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-09-12 17:58:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3035714285714286) 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-12 17:58:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-09-12 17:58:51,903 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 20 [2024-09-12 17:58:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:51,903 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-09-12 17:58:51,903 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:51,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-09-12 17:58:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:58:51,904 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:51,904 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-12 17:58:51,904 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 17:58:51,905 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:51,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1220271949, now seen corresponding path program 1 times [2024-09-12 17:58:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400066999] [2024-09-12 17:58:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:51,963 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-12 17:58:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400066999] [2024-09-12 17:58:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400066999] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245405820] [2024-09-12 17:58:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:51,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:51,965 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:52,123 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-12 17:58:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:52,125 INFO L225 Difference]: With dead ends: 72 [2024-09-12 17:58:52,125 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 17:58:52,125 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-12 17:58:52,126 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:52,126 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 83 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 17:58:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-09-12 17:58:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.290909090909091) 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-12 17:58:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-09-12 17:58:52,134 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 20 [2024-09-12 17:58:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:52,134 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-09-12 17:58:52,135 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12 17:58:52,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-09-12 17:58:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:58:52,136 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:52,136 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-12 17:58:52,136 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 17:58:52,138 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr26ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:52,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 125060739, now seen corresponding path program 1 times [2024-09-12 17:58:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150147539] [2024-09-12 17:58:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,293 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-12 17:58:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150147539] [2024-09-12 17:58:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150147539] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:52,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:52,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:58:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030968085] [2024-09-12 17:58:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:52,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:58:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:58:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:52,296 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:58:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:52,505 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-09-12 17:58:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 17:58:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:52,507 INFO L225 Difference]: With dead ends: 110 [2024-09-12 17:58:52,507 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 17:58:52,508 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:58:52,508 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:52,508 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 17:58:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-09-12 17:58:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3) internal successors, (104), 91 states have internal predecessors, (104), 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-12 17:58:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-09-12 17:58:52,532 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 20 [2024-09-12 17:58:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:52,533 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-09-12 17:58:52,533 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:58:52,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-09-12 17:58:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:58:52,535 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:52,535 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-12 17:58:52,536 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 17:58:52,536 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:52,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -770534168, now seen corresponding path program 1 times [2024-09-12 17:58:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669087789] [2024-09-12 17:58:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,631 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-12 17:58:52,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669087789] [2024-09-12 17:58:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669087789] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339141750] [2024-09-12 17:58:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:52,633 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:52,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:52,634 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-12 17:58:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:52,806 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-09-12 17:58:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:52,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-12 17:58:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:52,808 INFO L225 Difference]: With dead ends: 95 [2024-09-12 17:58:52,808 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 17:58:52,808 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-12 17:58:52,809 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:52,810 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 77 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 17:58:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-09-12 17:58:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 89 states have internal predecessors, (101), 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-12 17:58:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-09-12 17:58:52,820 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 21 [2024-09-12 17:58:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:52,820 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-09-12 17:58:52,821 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-12 17:58:52,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-09-12 17:58:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:58:52,823 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:52,824 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-12 17:58:52,824 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 17:58:52,824 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr19ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:52,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -770922445, now seen corresponding path program 1 times [2024-09-12 17:58:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940889712] [2024-09-12 17:58:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:52,974 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-12 17:58:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940889712] [2024-09-12 17:58:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940889712] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:58:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034046012] [2024-09-12 17:58:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:52,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:58:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:58:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:52,977 INFO L87 Difference]: Start difference. First operand 93 states and 104 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-12 17:58:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:53,164 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-09-12 17:58:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:53,164 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-12 17:58:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:53,165 INFO L225 Difference]: With dead ends: 103 [2024-09-12 17:58:53,165 INFO L226 Difference]: Without dead ends: 99 [2024-09-12 17:58:53,166 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:58:53,166 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:53,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 118 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-12 17:58:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-09-12 17:58:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 89 states have internal predecessors, (100), 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-12 17:58:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-09-12 17:58:53,175 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 21 [2024-09-12 17:58:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:53,176 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-09-12 17:58:53,176 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-12 17:58:53,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-09-12 17:58:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:58:53,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:53,177 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-12 17:58:53,177 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 17:58:53,177 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:53,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -826272135, now seen corresponding path program 1 times [2024-09-12 17:58:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346564814] [2024-09-12 17:58:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,289 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-12 17:58:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346564814] [2024-09-12 17:58:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346564814] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:58:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516202874] [2024-09-12 17:58:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:53,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:58:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:58:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:53,293 INFO L87 Difference]: Start difference. First operand 93 states and 103 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-12 17:58:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:53,482 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-09-12 17:58:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:53,482 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-12 17:58:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:53,483 INFO L225 Difference]: With dead ends: 99 [2024-09-12 17:58:53,484 INFO L226 Difference]: Without dead ends: 97 [2024-09-12 17:58:53,484 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:58:53,484 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:53,485 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 110 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-12 17:58:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-09-12 17:58:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 89 states have internal predecessors, (99), 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-12 17:58:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-09-12 17:58:53,494 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 21 [2024-09-12 17:58:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:53,494 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-09-12 17:58:53,494 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-12 17:58:53,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-09-12 17:58:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:58:53,495 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:53,495 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-12 17:58:53,495 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 17:58:53,495 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:53,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash -424822857, now seen corresponding path program 1 times [2024-09-12 17:58:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14790924] [2024-09-12 17:58:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,613 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-12 17:58:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14790924] [2024-09-12 17:58:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14790924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:58:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024617120] [2024-09-12 17:58:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:53,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:58:53,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:53,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:58:53,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:53,615 INFO L87 Difference]: Start difference. First operand 93 states and 102 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-12 17:58:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:53,792 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2024-09-12 17:58:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 17:58:53,793 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-12 17:58:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:53,794 INFO L225 Difference]: With dead ends: 97 [2024-09-12 17:58:53,794 INFO L226 Difference]: Without dead ends: 95 [2024-09-12 17:58:53,794 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:58:53,795 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:53,795 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-12 17:58:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-09-12 17:58:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.240506329113924) internal successors, (98), 89 states have internal predecessors, (98), 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-12 17:58:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-09-12 17:58:53,805 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 21 [2024-09-12 17:58:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:53,805 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-09-12 17:58:53,805 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-12 17:58:53,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-09-12 17:58:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 17:58:53,806 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:53,806 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-12 17:58:53,806 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-12 17:58:53,807 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:53,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1883247713, now seen corresponding path program 1 times [2024-09-12 17:58:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:53,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839680119] [2024-09-12 17:58:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:53,915 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-12 17:58:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839680119] [2024-09-12 17:58:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839680119] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:58:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141424766] [2024-09-12 17:58:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:53,916 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:58:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:58:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:58:53,917 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:58:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:54,081 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-09-12 17:58:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 17:58:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:54,082 INFO L225 Difference]: With dead ends: 95 [2024-09-12 17:58:54,082 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 17:58:54,083 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:58:54,083 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:54,083 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 110 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 17:58:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-09-12 17:58:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 89 states have internal predecessors, (97), 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-12 17:58:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-09-12 17:58:54,093 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 22 [2024-09-12 17:58:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:54,093 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-09-12 17:58:54,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:58:54,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-09-12 17:58:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 17:58:54,094 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:54,094 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:54,094 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 17:58:54,094 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:54,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1326855842, now seen corresponding path program 1 times [2024-09-12 17:58:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367582194] [2024-09-12 17:58:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,151 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,154 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-12 17:58:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367582194] [2024-09-12 17:58:54,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367582194] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:54,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:58:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090893857] [2024-09-12 17:58:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:54,155 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:58:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:58:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:54,156 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-12 17:58:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:54,284 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-09-12 17:58:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:58:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 25 [2024-09-12 17:58:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:54,285 INFO L225 Difference]: With dead ends: 93 [2024-09-12 17:58:54,285 INFO L226 Difference]: Without dead ends: 91 [2024-09-12 17:58:54,286 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-12 17:58:54,286 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:54,287 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 127 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-12 17:58:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-09-12 17:58:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 87 states have internal predecessors, (95), 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-12 17:58:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2024-09-12 17:58:54,301 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 25 [2024-09-12 17:58:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:54,301 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2024-09-12 17:58:54,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-12 17:58:54,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-09-12 17:58:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 17:58:54,303 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:54,303 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:54,303 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 17:58:54,303 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:54,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1817144987, now seen corresponding path program 1 times [2024-09-12 17:58:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581333595] [2024-09-12 17:58:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,360 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-12 17:58:54,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:54,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581333595] [2024-09-12 17:58:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581333595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:54,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:54,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:58:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41978579] [2024-09-12 17:58:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:54,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:58:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:58:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:58:54,363 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-12 17:58:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:54,460 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-09-12 17:58:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:58:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 26 [2024-09-12 17:58:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:54,462 INFO L225 Difference]: With dead ends: 91 [2024-09-12 17:58:54,462 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 17:58:54,463 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:58:54,464 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:54,464 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 118 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 17:58:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-12 17:58:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 83 states have internal predecessors, (91), 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-12 17:58:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-09-12 17:58:54,476 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 26 [2024-09-12 17:58:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:54,476 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-09-12 17:58:54,476 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-12 17:58:54,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-09-12 17:58:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 17:58:54,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:54,477 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:54,477 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 17:58:54,477 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:54,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash 510160018, now seen corresponding path program 1 times [2024-09-12 17:58:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384294815] [2024-09-12 17:58:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,589 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-12 17:58:54,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384294815] [2024-09-12 17:58:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384294815] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 17:58:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425462294] [2024-09-12 17:58:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:54,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:58:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:58:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:58:54,592 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-12 17:58:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:54,736 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-09-12 17:58:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:54,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 27 [2024-09-12 17:58:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:54,737 INFO L225 Difference]: With dead ends: 87 [2024-09-12 17:58:54,737 INFO L226 Difference]: Without dead ends: 85 [2024-09-12 17:58:54,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:58:54,738 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:54,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 50 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-12 17:58:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-09-12 17:58:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 81 states have internal predecessors, (89), 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-12 17:58:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-09-12 17:58:54,748 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 27 [2024-09-12 17:58:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:54,748 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-09-12 17:58:54,748 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-12 17:58:54,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-09-12 17:58:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 17:58:54,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:54,750 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:54,750 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-12 17:58:54,750 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr26ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:54,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1435802514, now seen corresponding path program 1 times [2024-09-12 17:58:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014960882] [2024-09-12 17:58:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014960882] [2024-09-12 17:58:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014960882] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:58:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685009659] [2024-09-12 17:58:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:58:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:58:54,844 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-12 17:58:54,846 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-12 17:58:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:54,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-12 17:58:54,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:58:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:55,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:58:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 17:58:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685009659] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:58:55,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:58:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-12 17:58:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109027906] [2024-09-12 17:58:55,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:58:55,283 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 17:58:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 17:58:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-12 17:58:55,284 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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-12 17:58:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:55,601 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-09-12 17:58:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 17:58:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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 27 [2024-09-12 17:58:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:55,602 INFO L225 Difference]: With dead ends: 120 [2024-09-12 17:58:55,602 INFO L226 Difference]: Without dead ends: 114 [2024-09-12 17:58:55,603 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-12 17:58:55,603 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 400 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:55,606 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 86 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-09-12 17:58:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2024-09-12 17:58:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 99 states have (on average 1.202020202020202) internal successors, (119), 105 states have internal predecessors, (119), 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-12 17:58:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2024-09-12 17:58:55,624 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 27 [2024-09-12 17:58:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:55,624 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2024-09-12 17:58:55,624 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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-12 17:58:55,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2024-09-12 17:58:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 17:58:55,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:55,625 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:55,645 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 17:58:55,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-12 17:58:55,826 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr19ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:55,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1301193649, now seen corresponding path program 1 times [2024-09-12 17:58:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539662944] [2024-09-12 17:58:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:55,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:55,926 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-12 17:58:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539662944] [2024-09-12 17:58:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539662944] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 17:58:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80203678] [2024-09-12 17:58:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:55,927 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:58:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:58:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:58:55,928 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12 17:58:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:56,058 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-09-12 17:58:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:56,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 28 [2024-09-12 17:58:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:56,060 INFO L225 Difference]: With dead ends: 109 [2024-09-12 17:58:56,060 INFO L226 Difference]: Without dead ends: 105 [2024-09-12 17:58:56,060 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:58:56,061 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:56,061 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 36 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-09-12 17:58:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-09-12 17:58:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.1875) internal successors, (114), 101 states have internal predecessors, (114), 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-12 17:58:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-09-12 17:58:56,077 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 28 [2024-09-12 17:58:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:56,077 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-09-12 17:58:56,077 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12 17:58:56,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-09-12 17:58:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 17:58:56,078 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:56,078 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:56,079 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-12 17:58:56,079 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:56,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1245843959, now seen corresponding path program 1 times [2024-09-12 17:58:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738782015] [2024-09-12 17:58:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:56,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:56,187 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-12 17:58:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738782015] [2024-09-12 17:58:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738782015] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:58:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:58:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 17:58:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309358067] [2024-09-12 17:58:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:58:56,188 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:58:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:56,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:58:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:58:56,189 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12 17:58:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:56,313 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2024-09-12 17:58:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:58:56,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 28 [2024-09-12 17:58:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:56,314 INFO L225 Difference]: With dead ends: 105 [2024-09-12 17:58:56,315 INFO L226 Difference]: Without dead ends: 103 [2024-09-12 17:58:56,315 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:58:56,315 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 88 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:56,316 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 32 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:58:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-09-12 17:58:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-09-12 17:58:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 95 states have (on average 1.168421052631579) internal successors, (111), 99 states have internal predecessors, (111), 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-12 17:58:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-09-12 17:58:56,328 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 28 [2024-09-12 17:58:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:56,329 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-09-12 17:58:56,329 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12 17:58:56,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-09-12 17:58:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 17:58:56,330 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:56,330 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:56,330 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-12 17:58:56,330 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:56,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1553466504, now seen corresponding path program 1 times [2024-09-12 17:58:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211737095] [2024-09-12 17:58:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:56,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211737095] [2024-09-12 17:58:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211737095] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:58:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239024633] [2024-09-12 17:58:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:56,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:58:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:58:56,444 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-12 17:58:56,446 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-12 17:58:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:56,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-12 17:58:56,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:58:56,697 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-12 17:58:56,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:58:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 17:58:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239024633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:58:56,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:58:56,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-12 17:58:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829431868] [2024-09-12 17:58:56,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:58:56,803 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 17:58:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 17:58:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-12 17:58:56,804 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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-12 17:58:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:57,085 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2024-09-12 17:58:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 17:58:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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 28 [2024-09-12 17:58:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:57,086 INFO L225 Difference]: With dead ends: 103 [2024-09-12 17:58:57,086 INFO L226 Difference]: Without dead ends: 101 [2024-09-12 17:58:57,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:58:57,087 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 291 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:57,087 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 70 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:58:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-12 17:58:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-09-12 17:58:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.148936170212766) internal successors, (108), 97 states have internal predecessors, (108), 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-12 17:58:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-09-12 17:58:57,101 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 28 [2024-09-12 17:58:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:57,101 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-09-12 17:58:57,101 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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-12 17:58:57,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-09-12 17:58:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 17:58:57,102 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:57,102 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-12 17:58:57,119 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 17:58:57,303 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-12 17:58:57,303 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:57,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1490340604, now seen corresponding path program 1 times [2024-09-12 17:58:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939202954] [2024-09-12 17:58:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:57,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939202954] [2024-09-12 17:58:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939202954] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:58:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749534100] [2024-09-12 17:58:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:57,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:58:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:58:57,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:58:57,381 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 17:58:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:57,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:58:57,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:58:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:57,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:58:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749534100] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:58:57,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:58:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-09-12 17:58:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707402151] [2024-09-12 17:58:57,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:58:57,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:58:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:58:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:58:57,580 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-12 17:58:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:57,880 INFO L93 Difference]: Finished difference Result 235 states and 276 transitions. [2024-09-12 17:58:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 17:58:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 35 [2024-09-12 17:58:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:57,882 INFO L225 Difference]: With dead ends: 235 [2024-09-12 17:58:57,883 INFO L226 Difference]: Without dead ends: 231 [2024-09-12 17:58:57,883 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2024-09-12 17:58:57,883 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 230 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:57,884 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 71 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 17:58:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-09-12 17:58:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-09-12 17:58:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 224 states have (on average 1.1294642857142858) internal successors, (253), 227 states have internal predecessors, (253), 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-12 17:58:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2024-09-12 17:58:57,910 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 35 [2024-09-12 17:58:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:57,910 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2024-09-12 17:58:57,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-12 17:58:57,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2024-09-12 17:58:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-12 17:58:57,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:57,912 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:57,929 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 17:58:58,116 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-12 17:58:58,117 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:58,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2016169522, now seen corresponding path program 1 times [2024-09-12 17:58:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:58,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356606464] [2024-09-12 17:58:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:58,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:58:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:58:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356606464] [2024-09-12 17:58:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356606464] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:58:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993463442] [2024-09-12 17:58:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:58,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:58:58,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:58:58,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:58:58,294 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 17:58:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:58:58,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 17:58:58,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:58:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:58,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:58:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:58:58,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993463442] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:58:58,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:58:58,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-09-12 17:58:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129531357] [2024-09-12 17:58:58,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:58:58,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 17:58:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:58:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 17:58:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2024-09-12 17:58:58,698 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand has 22 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 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-12 17:58:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:58:59,352 INFO L93 Difference]: Finished difference Result 495 states and 586 transitions. [2024-09-12 17:58:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 17:58:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 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 67 [2024-09-12 17:58:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:58:59,355 INFO L225 Difference]: With dead ends: 495 [2024-09-12 17:58:59,355 INFO L226 Difference]: Without dead ends: 491 [2024-09-12 17:58:59,356 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2024-09-12 17:58:59,356 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 588 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 17:58:59,356 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 143 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 17:58:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-09-12 17:58:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-09-12 17:58:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 484 states have (on average 1.121900826446281) internal successors, (543), 487 states have internal predecessors, (543), 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-12 17:58:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 546 transitions. [2024-09-12 17:58:59,413 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 546 transitions. Word has length 67 [2024-09-12 17:58:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:58:59,413 INFO L474 AbstractCegarLoop]: Abstraction has 491 states and 546 transitions. [2024-09-12 17:58:59,414 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 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-12 17:58:59,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 546 transitions. [2024-09-12 17:58:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-12 17:58:59,416 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:58:59,416 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:58:59,434 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 17:58:59,620 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:58:59,621 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:58:59,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:58:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1720701021, now seen corresponding path program 2 times [2024-09-12 17:58:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:58:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091114840] [2024-09-12 17:58:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:58:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:58:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:00,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091114840] [2024-09-12 17:59:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091114840] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697190725] [2024-09-12 17:59:00,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:59:00,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:00,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:00,180 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 17:59:00,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:59:00,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:59:00,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 17:59:00,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-09-12 17:59:00,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:59:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-09-12 17:59:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697190725] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:59:00,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:59:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 6] total 30 [2024-09-12 17:59:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137942061] [2024-09-12 17:59:00,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:59:00,760 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 17:59:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 17:59:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2024-09-12 17:59:00,762 INFO L87 Difference]: Start difference. First operand 491 states and 546 transitions. Second operand has 31 states, 30 states have (on average 6.333333333333333) internal successors, (190), 30 states have internal predecessors, (190), 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-12 17:59:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:02,372 INFO L93 Difference]: Finished difference Result 568 states and 639 transitions. [2024-09-12 17:59:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-09-12 17:59:02,372 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 6.333333333333333) internal successors, (190), 30 states have internal predecessors, (190), 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 132 [2024-09-12 17:59:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:02,374 INFO L225 Difference]: With dead ends: 568 [2024-09-12 17:59:02,374 INFO L226 Difference]: Without dead ends: 182 [2024-09-12 17:59:02,377 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2887, Invalid=6425, Unknown=0, NotChecked=0, Total=9312 [2024-09-12 17:59:02,377 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1789 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:02,378 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 160 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 17:59:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-09-12 17:59:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-09-12 17:59:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 178 states have internal predecessors, (180), 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-12 17:59:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2024-09-12 17:59:02,400 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 132 [2024-09-12 17:59:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:02,401 INFO L474 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2024-09-12 17:59:02,401 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 6.333333333333333) internal successors, (190), 30 states have internal predecessors, (190), 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-12 17:59:02,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2024-09-12 17:59:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-09-12 17:59:02,403 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:02,403 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:02,420 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 17:59:02,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-12 17:59:02,606 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:02,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash -252440858, now seen corresponding path program 1 times [2024-09-12 17:59:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483996688] [2024-09-12 17:59:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:03,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483996688] [2024-09-12 17:59:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483996688] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093578674] [2024-09-12 17:59:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:03,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:03,187 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 17:59:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:03,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 17:59:03,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:03,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:59:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093578674] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:59:04,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:59:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 47 [2024-09-12 17:59:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324832403] [2024-09-12 17:59:04,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:59:04,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 17:59:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 17:59:04,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 17:59:04,191 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 47 states have internal predecessors, (327), 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-12 17:59:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:04,786 INFO L93 Difference]: Finished difference Result 622 states and 689 transitions. [2024-09-12 17:59:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-12 17:59:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 47 states have internal predecessors, (327), 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 162 [2024-09-12 17:59:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:04,789 INFO L225 Difference]: With dead ends: 622 [2024-09-12 17:59:04,789 INFO L226 Difference]: Without dead ends: 343 [2024-09-12 17:59:04,790 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 17:59:04,791 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 530 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:04,791 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 146 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:59:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-09-12 17:59:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-09-12 17:59:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 337 states have (on average 1.0118694362017804) internal successors, (341), 339 states have internal predecessors, (341), 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-12 17:59:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2024-09-12 17:59:04,831 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 162 [2024-09-12 17:59:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:04,831 INFO L474 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2024-09-12 17:59:04,831 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 47 states have internal predecessors, (327), 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-12 17:59:04,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2024-09-12 17:59:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-09-12 17:59:04,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:04,835 INFO L216 NwaCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:04,851 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 17:59:05,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-12 17:59:05,036 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:05,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash -909564587, now seen corresponding path program 2 times [2024-09-12 17:59:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353748853] [2024-09-12 17:59:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:07,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6237 backedges. 0 proven. 6237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353748853] [2024-09-12 17:59:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353748853] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261454028] [2024-09-12 17:59:07,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:59:07,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:07,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:07,272 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 17:59:07,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:59:07,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:59:07,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 17:59:07,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6237 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6237 trivial. 0 not checked. [2024-09-12 17:59:07,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:59:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261454028] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:59:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:59:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [47] total 52 [2024-09-12 17:59:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24798461] [2024-09-12 17:59:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:59:07,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:59:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:59:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1141, Invalid=1615, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 17:59:07,886 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-12 17:59:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:08,093 INFO L93 Difference]: Finished difference Result 343 states and 344 transitions. [2024-09-12 17:59:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 17:59:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 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 323 [2024-09-12 17:59:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:08,095 INFO L225 Difference]: With dead ends: 343 [2024-09-12 17:59:08,096 INFO L226 Difference]: Without dead ends: 330 [2024-09-12 17:59:08,097 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1165, Invalid=2027, Unknown=0, NotChecked=0, Total=3192 [2024-09-12 17:59:08,097 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:08,098 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:59:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-09-12 17:59:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-09-12 17:59:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 325 states have (on average 1.0061538461538462) internal successors, (327), 326 states have internal predecessors, (327), 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-12 17:59:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2024-09-12 17:59:08,134 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 323 [2024-09-12 17:59:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:08,134 INFO L474 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2024-09-12 17:59:08,135 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 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-12 17:59:08,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2024-09-12 17:59:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-09-12 17:59:08,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:08,157 INFO L216 NwaCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:08,176 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 17:59:08,357 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:08,358 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:08,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 36799675, now seen corresponding path program 1 times [2024-09-12 17:59:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130033485] [2024-09-12 17:59:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:10,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6536 backedges. 0 proven. 6536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:10,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130033485] [2024-09-12 17:59:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130033485] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131907287] [2024-09-12 17:59:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:10,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:10,395 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 17:59:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:10,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-12 17:59:10,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6536 backedges. 0 proven. 6536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:10,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:59:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6536 backedges. 0 proven. 6536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131907287] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:59:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:59:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 93 [2024-09-12 17:59:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038948107] [2024-09-12 17:59:13,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:59:13,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-09-12 17:59:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-09-12 17:59:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2024-09-12 17:59:13,202 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand has 94 states, 93 states have (on average 6.978494623655914) internal successors, (649), 93 states have internal predecessors, (649), 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-12 17:59:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:14,378 INFO L93 Difference]: Finished difference Result 884 states and 974 transitions. [2024-09-12 17:59:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-09-12 17:59:14,379 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 6.978494623655914) internal successors, (649), 93 states have internal predecessors, (649), 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 323 [2024-09-12 17:59:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:14,382 INFO L225 Difference]: With dead ends: 884 [2024-09-12 17:59:14,382 INFO L226 Difference]: Without dead ends: 652 [2024-09-12 17:59:14,385 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2024-09-12 17:59:14,385 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 786 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:14,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 169 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 17:59:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-09-12 17:59:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2024-09-12 17:59:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 647 states have (on average 1.0030911901081916) internal successors, (649), 648 states have internal predecessors, (649), 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-12 17:59:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 652 transitions. [2024-09-12 17:59:14,458 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 652 transitions. Word has length 323 [2024-09-12 17:59:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:14,459 INFO L474 AbstractCegarLoop]: Abstraction has 652 states and 652 transitions. [2024-09-12 17:59:14,460 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 6.978494623655914) internal successors, (649), 93 states have internal predecessors, (649), 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-12 17:59:14,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 652 transitions. [2024-09-12 17:59:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2024-09-12 17:59:14,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:14,472 INFO L216 NwaCegarLoop]: trace histogram [90, 90, 90, 90, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:14,493 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 17:59:14,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:14,673 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:14,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1877113125, now seen corresponding path program 2 times [2024-09-12 17:59:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667641735] [2024-09-12 17:59:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:21,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27857 backedges. 0 proven. 27857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667641735] [2024-09-12 17:59:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667641735] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431181301] [2024-09-12 17:59:21,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:59:21,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:21,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:21,534 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-12 17:59:21,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:59:21,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:59:21,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 17:59:21,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27857 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 27768 trivial. 0 not checked. [2024-09-12 17:59:22,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:59:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431181301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:59:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:59:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [93] total 98 [2024-09-12 17:59:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868629079] [2024-09-12 17:59:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:59:22,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:59:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:59:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4384, Invalid=5318, Unknown=0, NotChecked=0, Total=9702 [2024-09-12 17:59:22,516 INFO L87 Difference]: Start difference. First operand 652 states and 652 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 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-12 17:59:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:22,792 INFO L93 Difference]: Finished difference Result 652 states and 652 transitions. [2024-09-12 17:59:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 17:59:22,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 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 645 [2024-09-12 17:59:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:22,797 INFO L225 Difference]: With dead ends: 652 [2024-09-12 17:59:22,797 INFO L226 Difference]: Without dead ends: 646 [2024-09-12 17:59:22,800 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4408, Invalid=6098, Unknown=0, NotChecked=0, Total=10506 [2024-09-12 17:59:22,801 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:22,801 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:59:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-09-12 17:59:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2024-09-12 17:59:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 642 states have (on average 1.0015576323987538) internal successors, (643), 642 states have internal predecessors, (643), 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-12 17:59:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 646 transitions. [2024-09-12 17:59:22,873 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 646 transitions. Word has length 645 [2024-09-12 17:59:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:22,874 INFO L474 AbstractCegarLoop]: Abstraction has 646 states and 646 transitions. [2024-09-12 17:59:22,874 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 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-12 17:59:22,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 646 transitions. [2024-09-12 17:59:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2024-09-12 17:59:22,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:22,879 INFO L216 NwaCegarLoop]: trace histogram [91, 91, 90, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:22,896 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-12 17:59:23,083 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-09-12 17:59:23,084 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:23,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1668164020, now seen corresponding path program 1 times [2024-09-12 17:59:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008176897] [2024-09-12 17:59:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:29,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:59:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28305 backedges. 0 proven. 28305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:59:29,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008176897] [2024-09-12 17:59:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008176897] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:59:29,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783113432] [2024-09-12 17:59:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:59:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:59:29,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:59:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-12 17:59:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:59:29,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 2342 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-09-12 17:59:29,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:59:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 28305 backedges. 0 proven. 28305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:30,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:59:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28305 backedges. 0 proven. 28305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:59:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783113432] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:59:38,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:59:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 92, 92] total 185 [2024-09-12 17:59:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056691126] [2024-09-12 17:59:38,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:59:38,679 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 186 states [2024-09-12 17:59:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:59:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2024-09-12 17:59:38,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17022, Invalid=17388, Unknown=0, NotChecked=0, Total=34410 [2024-09-12 17:59:38,689 INFO L87 Difference]: Start difference. First operand 646 states and 646 transitions. Second operand has 186 states, 185 states have (on average 6.989189189189189) internal successors, (1293), 185 states have internal predecessors, (1293), 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-12 17:59:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:59:40,553 INFO L93 Difference]: Finished difference Result 1291 states and 1382 transitions. [2024-09-12 17:59:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2024-09-12 17:59:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 186 states, 185 states have (on average 6.989189189189189) internal successors, (1293), 185 states have internal predecessors, (1293), 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 645 [2024-09-12 17:59:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:59:40,560 INFO L225 Difference]: With dead ends: 1291 [2024-09-12 17:59:40,561 INFO L226 Difference]: Without dead ends: 1290 [2024-09-12 17:59:40,563 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1384 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17208, Invalid=17574, Unknown=0, NotChecked=0, Total=34782 [2024-09-12 17:59:40,564 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 17:59:40,564 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 17:59:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-09-12 17:59:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2024-09-12 17:59:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1286 states have (on average 1.000777604976672) internal successors, (1287), 1286 states have internal predecessors, (1287), 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-12 17:59:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1290 transitions. [2024-09-12 17:59:40,694 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1290 transitions. Word has length 645 [2024-09-12 17:59:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:59:40,695 INFO L474 AbstractCegarLoop]: Abstraction has 1290 states and 1290 transitions. [2024-09-12 17:59:40,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 186 states, 185 states have (on average 6.989189189189189) internal successors, (1293), 185 states have internal predecessors, (1293), 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-12 17:59:40,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1290 transitions. [2024-09-12 17:59:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2024-09-12 17:59:40,707 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:59:40,708 INFO L216 NwaCegarLoop]: trace histogram [183, 183, 182, 182, 182, 182, 182, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:59:40,728 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-12 17:59:40,908 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-09-12 17:59:40,909 INFO L399 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 17:59:40,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:59:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1900756340, now seen corresponding path program 2 times [2024-09-12 17:59:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:59:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609351854] [2024-09-12 17:59:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:59:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:59:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:07,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 115843 backedges. 0 proven. 115843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:07,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609351854] [2024-09-12 18:00:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609351854] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260986587] [2024-09-12 18:00:07,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:00:07,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:07,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:07,555 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-12 18:00:08,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:00:08,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:00:08,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 4642 conjuncts, 184 conjuncts are in the unsatisfiable core [2024-09-12 18:00:08,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 115843 backedges. 0 proven. 115843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:09,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:00:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 115843 backedges. 0 proven. 115843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260986587] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:00:42,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:00:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [185, 184, 184] total 369 [2024-09-12 18:00:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474576685] [2024-09-12 18:00:42,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:00:42,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 370 states [2024-09-12 18:00:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 370 interpolants. [2024-09-12 18:00:42,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67898, Invalid=68632, Unknown=0, NotChecked=0, Total=136530 [2024-09-12 18:00:42,408 INFO L87 Difference]: Start difference. First operand 1290 states and 1290 transitions. Second operand has 370 states, 369 states have (on average 6.994579945799458) internal successors, (2581), 369 states have internal predecessors, (2581), 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-12 18:00:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:52,865 INFO L93 Difference]: Finished difference Result 2579 states and 2762 transitions. [2024-09-12 18:00:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 370 states. [2024-09-12 18:00:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 370 states, 369 states have (on average 6.994579945799458) internal successors, (2581), 369 states have internal predecessors, (2581), 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 1289 [2024-09-12 18:00:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:52,880 INFO L225 Difference]: With dead ends: 2579 [2024-09-12 18:00:52,880 INFO L226 Difference]: Without dead ends: 2578 [2024-09-12 18:00:52,888 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2764 GetRequests, 2395 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=68268, Invalid=69002, Unknown=0, NotChecked=0, Total=137270 [2024-09-12 18:00:52,889 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:52,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 399 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-09-12 18:00:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2024-09-12 18:00:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2024-09-12 18:00:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2574 states have (on average 1.0003885003885005) internal successors, (2575), 2574 states have internal predecessors, (2575), 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-12 18:00:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 2578 transitions. [2024-09-12 18:00:53,234 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 2578 transitions. Word has length 1289 [2024-09-12 18:00:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:53,236 INFO L474 AbstractCegarLoop]: Abstraction has 2578 states and 2578 transitions. [2024-09-12 18:00:53,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 370 states, 369 states have (on average 6.994579945799458) internal successors, (2581), 369 states have internal predecessors, (2581), 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-12 18:00:53,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 2578 transitions. [2024-09-12 18:00:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2578 [2024-09-12 18:00:53,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:53,278 INFO L216 NwaCegarLoop]: trace histogram [367, 367, 366, 366, 366, 366, 366, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:53,308 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-12 18:00:53,479 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:53,479 INFO L399 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-12 18:00:53,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 90061580, now seen corresponding path program 3 times [2024-09-12 18:00:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591192750] [2024-09-12 18:00:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat