./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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+lhb-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:24:57,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:24:57,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:24:57,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:24:57,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:24:57,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:24:57,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:24:57,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:24:57,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:24:57,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:24:57,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:24:57,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:24:57,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:24:57,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:24:57,400 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:24:57,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:24:57,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:24:57,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:24:57,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:24:57,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:24:57,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:24:57,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:24:57,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:24:57,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:24:57,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:24:57,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:24:57,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:24:57,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:24:57,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:24:57,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:24:57,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:24:57,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:24:57,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:24:57,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:24:57,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:24:57,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:24:57,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:24:57,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:24:57,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:24:57,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:24:57,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:24:57,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:24:57,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:24:57,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:24:57,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:24:57,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:24:57,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:24:57,756 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:24:57,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-12 15:24:59,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:24:59,581 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:24:59,582 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-12 15:24:59,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/790940a8c/946558c896ad4854bb16d857abfadd0f/FLAG883a873d1 [2024-09-12 15:24:59,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/790940a8c/946558c896ad4854bb16d857abfadd0f [2024-09-12 15:24:59,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:24:59,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:24:59,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:24:59,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:24:59,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:24:59,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:24:59,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f68e192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59, skipping insertion in model container [2024-09-12 15:24:59,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:24:59,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:24:59,802 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+lhb-reducer.c[1224,1237] [2024-09-12 15:24:59,811 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+lhb-reducer.c[1636,1649] [2024-09-12 15:24:59,813 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+lhb-reducer.c[1851,1864] [2024-09-12 15:24:59,815 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+lhb-reducer.c[2384,2397] [2024-09-12 15:24:59,817 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+lhb-reducer.c[2599,2612] [2024-09-12 15:24:59,819 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+lhb-reducer.c[2901,2914] [2024-09-12 15:24:59,820 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+lhb-reducer.c[3116,3129] [2024-09-12 15:24:59,822 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+lhb-reducer.c[3386,3399] [2024-09-12 15:24:59,824 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+lhb-reducer.c[3604,3617] [2024-09-12 15:24:59,827 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+lhb-reducer.c[4088,4101] [2024-09-12 15:24:59,828 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+lhb-reducer.c[4306,4319] [2024-09-12 15:24:59,831 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+lhb-reducer.c[4802,4815] [2024-09-12 15:24:59,833 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+lhb-reducer.c[5203,5216] [2024-09-12 15:24:59,834 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+lhb-reducer.c[5421,5434] [2024-09-12 15:24:59,836 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+lhb-reducer.c[5792,5805] [2024-09-12 15:24:59,837 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+lhb-reducer.c[6010,6023] [2024-09-12 15:24:59,839 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+lhb-reducer.c[6296,6309] [2024-09-12 15:24:59,840 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+lhb-reducer.c[6514,6527] [2024-09-12 15:24:59,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:24:59,864 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:24:59,883 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+lhb-reducer.c[1224,1237] [2024-09-12 15:24:59,888 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+lhb-reducer.c[1636,1649] [2024-09-12 15:24:59,890 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+lhb-reducer.c[1851,1864] [2024-09-12 15:24:59,897 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+lhb-reducer.c[2384,2397] [2024-09-12 15:24:59,898 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+lhb-reducer.c[2599,2612] [2024-09-12 15:24:59,900 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+lhb-reducer.c[2901,2914] [2024-09-12 15:24:59,904 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+lhb-reducer.c[3116,3129] [2024-09-12 15:24:59,906 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+lhb-reducer.c[3386,3399] [2024-09-12 15:24:59,908 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+lhb-reducer.c[3604,3617] [2024-09-12 15:24:59,913 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+lhb-reducer.c[4088,4101] [2024-09-12 15:24:59,919 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+lhb-reducer.c[4306,4319] [2024-09-12 15:24:59,921 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+lhb-reducer.c[4802,4815] [2024-09-12 15:24:59,926 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+lhb-reducer.c[5203,5216] [2024-09-12 15:24:59,928 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+lhb-reducer.c[5421,5434] [2024-09-12 15:24:59,932 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+lhb-reducer.c[5792,5805] [2024-09-12 15:24:59,933 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+lhb-reducer.c[6010,6023] [2024-09-12 15:24:59,934 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+lhb-reducer.c[6296,6309] [2024-09-12 15:24:59,937 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+lhb-reducer.c[6514,6527] [2024-09-12 15:24:59,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:24:59,965 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:24:59,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59 WrapperNode [2024-09-12 15:24:59,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:24:59,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:24:59,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:24:59,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:24:59,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:24:59,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:24:59,998 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:24:59,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:25:00,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:25:00,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:25:00,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:25:00,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,040 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 15:25:00,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:25:00,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:25:00,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:25:00,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:25:00,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (1/1) ... [2024-09-12 15:25:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:25:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:00,151 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 15:25:00,163 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 15:25:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:25:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:25:00,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:25:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:25:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:25:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:25:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:25:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:25:00,291 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:25:00,293 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:25:00,593 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-09-12 15:25:00,593 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:25:00,618 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:25:00,620 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 15:25:00,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:00 BoogieIcfgContainer [2024-09-12 15:25:00,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:25:00,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:25:00,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:25:00,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:25:00,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:24:59" (1/3) ... [2024-09-12 15:25:00,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc48f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:00, skipping insertion in model container [2024-09-12 15:25:00,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:59" (2/3) ... [2024-09-12 15:25:00,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc48f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:00, skipping insertion in model container [2024-09-12 15:25:00,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:00" (3/3) ... [2024-09-12 15:25:00,631 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-09-12 15:25:00,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:25:00,651 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-09-12 15:25:00,713 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:25:00,720 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;@521de53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:25:00,720 INFO L337 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-09-12 15:25:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:25:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:25:00,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:00,733 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:00,735 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:00,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2024-09-12 15:25:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988917816] [2024-09-12 15:25:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,165 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 15:25:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988917816] [2024-09-12 15:25:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988917816] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:01,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226129357] [2024-09-12 15:25:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:01,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:01,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:01,207 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:01,495 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-09-12 15:25:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:01,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:25:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:01,509 INFO L225 Difference]: With dead ends: 89 [2024-09-12 15:25:01,510 INFO L226 Difference]: Without dead ends: 74 [2024-09-12 15:25:01,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:01,519 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:01,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-12 15:25:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-09-12 15:25:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-09-12 15:25:01,572 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-09-12 15:25:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:01,572 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-09-12 15:25:01,573 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-09-12 15:25:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:25:01,574 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:01,574 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:01,575 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:25:01,575 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:01,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2024-09-12 15:25:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898784781] [2024-09-12 15:25:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,709 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 15:25:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:01,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898784781] [2024-09-12 15:25:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898784781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:01,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:01,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171503292] [2024-09-12 15:25:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:01,712 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:01,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:01,713 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:01,872 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-09-12 15:25:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:25:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:01,874 INFO L225 Difference]: With dead ends: 74 [2024-09-12 15:25:01,874 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 15:25:01,875 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:01,876 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:01,877 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 15:25:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-09-12 15:25:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-09-12 15:25:01,888 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2024-09-12 15:25:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:01,889 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-09-12 15:25:01,889 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-09-12 15:25:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:25:01,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:01,892 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:01,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:25:01,893 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:01,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2024-09-12 15:25:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488777237] [2024-09-12 15:25:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,008 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 15:25:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488777237] [2024-09-12 15:25:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488777237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:02,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069397343] [2024-09-12 15:25:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:02,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:02,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:02,012 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,187 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-12 15:25:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:02,188 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 15:25:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,189 INFO L225 Difference]: With dead ends: 72 [2024-09-12 15:25:02,189 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 15:25:02,189 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 15:25:02,190 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,191 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 15:25:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-09-12 15:25:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-12 15:25:02,201 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2024-09-12 15:25:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,202 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-12 15:25:02,202 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 15:25:02,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-12 15:25:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:25:02,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,203 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:02,204 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:25:02,204 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:02,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2024-09-12 15:25:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873818817] [2024-09-12 15:25:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,303 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 15:25:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873818817] [2024-09-12 15:25:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873818817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434640575] [2024-09-12 15:25:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,306 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:02,310 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,489 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-12 15:25:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:02,489 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 15:25:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,490 INFO L225 Difference]: With dead ends: 70 [2024-09-12 15:25:02,490 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 15:25:02,491 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:25:02,492 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 15:25:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-12 15:25:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-12 15:25:02,508 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2024-09-12 15:25:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,509 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-12 15:25:02,509 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 15:25:02,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-12 15:25:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:25:02,510 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,510 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:02,510 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:25:02,510 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:02,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,511 INFO L85 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2024-09-12 15:25:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650961340] [2024-09-12 15:25:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,619 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 15:25:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650961340] [2024-09-12 15:25:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650961340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377123585] [2024-09-12 15:25:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,621 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:02,622 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,790 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-12 15:25:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:25:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,792 INFO L225 Difference]: With dead ends: 68 [2024-09-12 15:25:02,792 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 15:25:02,793 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 15:25:02,794 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,794 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 15:25:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-12 15:25:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-09-12 15:25:02,808 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-09-12 15:25:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,809 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-09-12 15:25:02,809 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-09-12 15:25:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:25:02,810 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,811 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:02,811 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 15:25:02,811 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:02,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2024-09-12 15:25:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940174905] [2024-09-12 15:25:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,905 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 15:25:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940174905] [2024-09-12 15:25:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940174905] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911518717] [2024-09-12 15:25:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:02,909 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,048 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-12 15:25:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:25:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,050 INFO L225 Difference]: With dead ends: 66 [2024-09-12 15:25:03,050 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 15:25:03,050 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 15:25:03,051 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,051 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 15:25:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-12 15:25:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-09-12 15:25:03,060 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2024-09-12 15:25:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,060 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-09-12 15:25:03,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-09-12 15:25:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:25:03,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,062 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:03,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:25:03,062 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:03,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2024-09-12 15:25:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421604028] [2024-09-12 15:25:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421604028] [2024-09-12 15:25:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421604028] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344084320] [2024-09-12 15:25:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:03,120 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,230 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-12 15:25:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:03,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:25:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,232 INFO L225 Difference]: With dead ends: 64 [2024-09-12 15:25:03,232 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 15:25:03,232 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:03,233 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,234 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 15:25:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-09-12 15:25:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-12 15:25:03,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2024-09-12 15:25:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,247 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-12 15:25:03,247 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-12 15:25:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:25:03,248 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,249 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:03,249 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 15:25:03,249 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:03,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2024-09-12 15:25:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408447826] [2024-09-12 15:25:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,310 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 15:25:03,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408447826] [2024-09-12 15:25:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408447826] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826150230] [2024-09-12 15:25:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:03,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:03,315 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,412 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-12 15:25:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:25:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,414 INFO L225 Difference]: With dead ends: 60 [2024-09-12 15:25:03,414 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 15:25:03,414 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:03,417 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,417 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 15:25:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-12 15:25:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-09-12 15:25:03,429 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2024-09-12 15:25:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,430 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-09-12 15:25:03,430 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-09-12 15:25:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:25:03,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,431 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:03,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 15:25:03,431 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:03,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2024-09-12 15:25:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871956763] [2024-09-12 15:25:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,583 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 15:25:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871956763] [2024-09-12 15:25:03,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871956763] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967472632] [2024-09-12 15:25:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,584 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:03,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:03,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:03,585 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,744 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-12 15:25:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:25:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,746 INFO L225 Difference]: With dead ends: 88 [2024-09-12 15:25:03,746 INFO L226 Difference]: Without dead ends: 86 [2024-09-12 15:25:03,747 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:03,747 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,748 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 119 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-12 15:25:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2024-09-12 15:25:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-12 15:25:03,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-12 15:25:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,758 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-12 15:25:03,759 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-12 15:25:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:25:03,760 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,760 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:03,760 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 15:25:03,760 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:03,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2024-09-12 15:25:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026317933] [2024-09-12 15:25:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,878 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 15:25:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026317933] [2024-09-12 15:25:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026317933] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474289770] [2024-09-12 15:25:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:03,882 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,058 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-09-12 15:25:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:25:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,059 INFO L225 Difference]: With dead ends: 86 [2024-09-12 15:25:04,059 INFO L226 Difference]: Without dead ends: 84 [2024-09-12 15:25:04,060 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:04,060 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,060 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 147 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-12 15:25:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-09-12 15:25:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-09-12 15:25:04,070 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 16 [2024-09-12 15:25:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,071 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-09-12 15:25:04,071 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-09-12 15:25:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:25:04,072 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,072 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,072 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 15:25:04,072 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:04,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2024-09-12 15:25:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946497798] [2024-09-12 15:25:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,139 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 15:25:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946497798] [2024-09-12 15:25:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946497798] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610979819] [2024-09-12 15:25:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,141 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:04,142 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,258 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-09-12 15:25:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:25:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,259 INFO L225 Difference]: With dead ends: 62 [2024-09-12 15:25:04,259 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 15:25:04,260 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 15:25:04,260 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,260 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 15:25:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-12 15:25:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-12 15:25:04,274 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-12 15:25:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,275 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-12 15:25:04,275 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-12 15:25:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:25:04,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,277 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,277 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 15:25:04,278 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:04,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2024-09-12 15:25:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766199383] [2024-09-12 15:25:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,356 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 15:25:04,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766199383] [2024-09-12 15:25:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766199383] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061699176] [2024-09-12 15:25:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:04,359 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,484 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-12 15:25:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:25:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,485 INFO L225 Difference]: With dead ends: 60 [2024-09-12 15:25:04,485 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 15:25:04,485 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 15:25:04,486 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,486 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 15:25:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-12 15:25:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-12 15:25:04,498 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 16 [2024-09-12 15:25:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,498 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-12 15:25:04,498 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-12 15:25:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:25:04,500 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,501 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 15:25:04,502 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:04,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2024-09-12 15:25:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827241545] [2024-09-12 15:25:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,590 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 15:25:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827241545] [2024-09-12 15:25:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827241545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849160832] [2024-09-12 15:25:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:04,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:04,592 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,710 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-12 15:25:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:04,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,711 INFO L225 Difference]: With dead ends: 58 [2024-09-12 15:25:04,712 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 15:25:04,712 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 15:25:04,713 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,713 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 15:25:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-12 15:25:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-09-12 15:25:04,722 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2024-09-12 15:25:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,722 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-09-12 15:25:04,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-09-12 15:25:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:25:04,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,724 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 15:25:04,724 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:04,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2024-09-12 15:25:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333569573] [2024-09-12 15:25:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,849 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 15:25:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333569573] [2024-09-12 15:25:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333569573] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919238637] [2024-09-12 15:25:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:04,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:04,851 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,997 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-12 15:25:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,998 INFO L225 Difference]: With dead ends: 72 [2024-09-12 15:25:04,998 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 15:25:04,998 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:04,999 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,999 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 15:25:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-09-12 15:25:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-12 15:25:05,007 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-09-12 15:25:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,007 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-12 15:25:05,008 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-12 15:25:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:25:05,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:05,009 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:05,009 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 15:25:05,009 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:05,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2024-09-12 15:25:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863143284] [2024-09-12 15:25:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863143284] [2024-09-12 15:25:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863143284] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293627195] [2024-09-12 15:25:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:05,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:05,120 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:05,266 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-12 15:25:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:05,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:05,268 INFO L225 Difference]: With dead ends: 73 [2024-09-12 15:25:05,268 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 15:25:05,269 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:25:05,270 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:05,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 15:25:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-09-12 15:25:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-12 15:25:05,281 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-12 15:25:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,282 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-12 15:25:05,282 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-12 15:25:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 15:25:05,283 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:05,283 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 15:25:05,283 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 15:25:05,283 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:05,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2024-09-12 15:25:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2775508] [2024-09-12 15:25:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,397 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 15:25:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2775508] [2024-09-12 15:25:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2775508] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64521697] [2024-09-12 15:25:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:05,399 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:05,400 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:05,536 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-12 15:25:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 15:25:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:05,537 INFO L225 Difference]: With dead ends: 69 [2024-09-12 15:25:05,538 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 15:25:05,538 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:05,538 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:05,539 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 15:25:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-12 15:25:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-09-12 15:25:05,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 18 [2024-09-12 15:25:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,555 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-09-12 15:25:05,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-09-12 15:25:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 15:25:05,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:05,556 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 15:25:05,556 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 15:25:05,556 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:05,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2024-09-12 15:25:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882360823] [2024-09-12 15:25:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,623 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 15:25:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882360823] [2024-09-12 15:25:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882360823] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:05,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063628450] [2024-09-12 15:25:05,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:05,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:05,626 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:05,715 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-12 15:25:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:05,715 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 15:25:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:05,716 INFO L225 Difference]: With dead ends: 65 [2024-09-12 15:25:05,716 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 15:25:05,717 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:05,717 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:05,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 15:25:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 15:25:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-12 15:25:05,726 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 19 [2024-09-12 15:25:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,726 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-12 15:25:05,726 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 15:25:05,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-12 15:25:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 15:25:05,727 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:05,727 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 15:25:05,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-12 15:25:05,728 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:05,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2024-09-12 15:25:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447244771] [2024-09-12 15:25:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,777 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 15:25:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447244771] [2024-09-12 15:25:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447244771] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390384234] [2024-09-12 15:25:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:05,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:05,779 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:05,855 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-09-12 15:25:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:05,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 15:25:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:05,856 INFO L225 Difference]: With dead ends: 63 [2024-09-12 15:25:05,856 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 15:25:05,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:05,857 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:05,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 15:25:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-12 15:25:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-09-12 15:25:05,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2024-09-12 15:25:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,865 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-09-12 15:25:05,865 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-09-12 15:25:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:05,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:05,866 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:05,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 15:25:05,866 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:05,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1687468520, now seen corresponding path program 1 times [2024-09-12 15:25:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142351125] [2024-09-12 15:25:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142351125] [2024-09-12 15:25:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142351125] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:05,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108746633] [2024-09-12 15:25:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:05,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:05,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:05,994 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 15:25:05,995 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 15:25:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:06,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-12 15:25:06,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:06,283 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 15:25:06,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:25:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108746633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:06,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-12 15:25:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201627156] [2024-09-12 15:25:06,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:06,387 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 15:25:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 15:25:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-12 15:25:06,388 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:06,712 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-12 15:25:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 15:25:06,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 15:25:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:06,713 INFO L225 Difference]: With dead ends: 86 [2024-09-12 15:25:06,713 INFO L226 Difference]: Without dead ends: 84 [2024-09-12 15:25:06,714 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-12 15:25:06,714 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:06,714 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 139 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-12 15:25:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2024-09-12 15:25:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-09-12 15:25:06,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2024-09-12 15:25:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:06,724 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-09-12 15:25:06,724 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:06,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-09-12 15:25:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:06,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:06,725 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:06,742 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 15:25:06,925 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:06,926 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:06,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1687899496, now seen corresponding path program 1 times [2024-09-12 15:25:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:06,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850685104] [2024-09-12 15:25:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:07,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850685104] [2024-09-12 15:25:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850685104] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308802135] [2024-09-12 15:25:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:07,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:07,046 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 15:25:07,048 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 15:25:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:07,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-12 15:25:07,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:07,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:25:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308802135] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:07,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-12 15:25:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912548861] [2024-09-12 15:25:07,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:07,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 15:25:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 15:25:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-12 15:25:07,394 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:07,647 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-09-12 15:25:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 15:25:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 15:25:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:07,649 INFO L225 Difference]: With dead ends: 82 [2024-09-12 15:25:07,649 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 15:25:07,649 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-12 15:25:07,650 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:07,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 96 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 15:25:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 48. [2024-09-12 15:25:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-09-12 15:25:07,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 21 [2024-09-12 15:25:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:07,660 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-09-12 15:25:07,661 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:07,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-09-12 15:25:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:07,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:07,662 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 15:25:07,675 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 15:25:07,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:07,865 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:07,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 267428458, now seen corresponding path program 1 times [2024-09-12 15:25:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534272466] [2024-09-12 15:25:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:07,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:07,952 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 15:25:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534272466] [2024-09-12 15:25:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534272466] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519263987] [2024-09-12 15:25:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:07,955 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:07,956 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:08,086 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-12 15:25:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:08,086 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 15:25:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:08,087 INFO L225 Difference]: With dead ends: 48 [2024-09-12 15:25:08,087 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 15:25:08,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:08,088 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:08,088 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 15:25:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-12 15:25:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-09-12 15:25:08,097 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2024-09-12 15:25:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:08,097 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-09-12 15:25:08,098 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 15:25:08,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-09-12 15:25:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 15:25:08,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:08,099 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 15:25:08,099 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-12 15:25:08,099 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:08,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1335654093, now seen corresponding path program 1 times [2024-09-12 15:25:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077749032] [2024-09-12 15:25:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:08,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:08,192 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 15:25:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077749032] [2024-09-12 15:25:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077749032] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:08,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:08,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 15:25:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086644910] [2024-09-12 15:25:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:08,193 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 15:25:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 15:25:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:25:08,194 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:08,298 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-09-12 15:25:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 15:25:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:08,299 INFO L225 Difference]: With dead ends: 43 [2024-09-12 15:25:08,299 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 15:25:08,299 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:08,300 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:08,300 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 15:25:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-12 15:25:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-12 15:25:08,309 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-09-12 15:25:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:08,310 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-12 15:25:08,310 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-12 15:25:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 15:25:08,311 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:08,311 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 15:25:08,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-12 15:25:08,312 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-12 15:25:08,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1287938843, now seen corresponding path program 1 times [2024-09-12 15:25:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:08,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120590620] [2024-09-12 15:25:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:08,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:08,414 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 15:25:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120590620] [2024-09-12 15:25:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120590620] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 15:25:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056667538] [2024-09-12 15:25:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:08,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 15:25:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 15:25:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:25:08,417 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:08,513 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-12 15:25:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:08,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 15:25:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:08,513 INFO L225 Difference]: With dead ends: 38 [2024-09-12 15:25:08,514 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:25:08,514 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:08,514 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:08,515 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:25:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:25:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 15:25:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:25:08,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-12 15:25:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:08,516 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:25:08,516 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:08,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:25:08,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:25:08,519 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-09-12 15:25:08,519 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-09-12 15:25:08,520 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-09-12 15:25:08,521 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-09-12 15:25:08,522 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-09-12 15:25:08,522 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-09-12 15:25:08,522 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-09-12 15:25:08,522 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-09-12 15:25:08,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-12 15:25:08,525 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:08,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:25:10,334 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:25:10,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:25:10 BoogieIcfgContainer [2024-09-12 15:25:10,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:25:10,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:25:10,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:25:10,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:25:10,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:00" (3/4) ... [2024-09-12 15:25:10,363 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:25:10,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:25:10,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:25:10,375 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-09-12 15:25:10,376 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 15:25:10,376 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 15:25:10,377 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:25:10,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:25:10,481 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:25:10,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:25:10,484 INFO L158 Benchmark]: Toolchain (without parser) took 10876.91ms. Allocated memory was 83.9MB in the beginning and 211.8MB in the end (delta: 127.9MB). Free memory was 61.6MB in the beginning and 112.4MB in the end (delta: -50.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,484 INFO L158 Benchmark]: CDTParser took 1.51ms. Allocated memory is still 58.7MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:10,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.57ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 42.4MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 83.9MB. Free memory was 42.4MB in the beginning and 41.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:10,485 INFO L158 Benchmark]: Boogie Preprocessor took 65.94ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 39.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,485 INFO L158 Benchmark]: RCFGBuilder took 554.12ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 45.2MB in the end (delta: -6.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,485 INFO L158 Benchmark]: TraceAbstraction took 9736.92ms. Allocated memory was 83.9MB in the beginning and 211.8MB in the end (delta: 127.9MB). Free memory was 44.4MB in the beginning and 119.7MB in the end (delta: -75.3MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,485 INFO L158 Benchmark]: Witness Printer took 122.52ms. Allocated memory is still 211.8MB. Free memory was 119.7MB in the beginning and 112.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 15:25:10,491 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51ms. Allocated memory is still 58.7MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.57ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 42.4MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 83.9MB. Free memory was 42.4MB in the beginning and 41.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.94ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 39.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.12ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 45.2MB in the end (delta: -6.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9736.92ms. Allocated memory was 83.9MB in the beginning and 211.8MB in the end (delta: 127.9MB). Free memory was 44.4MB in the beginning and 119.7MB in the end (delta: -75.3MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 122.52ms. Allocated memory is still 211.8MB. Free memory was 119.7MB in the beginning and 112.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 84]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 114]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 126]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 142]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 154]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 224]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 236]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 278]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 297]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 309]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 333]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 345]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 366]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 378]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1154 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1705 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3234 IncrementalHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 716 mSDtfsCounter, 3234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 6 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 282]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 63]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && ((0 < main__t) || (main__t == 0))) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:25:10,516 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE