./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:35:52,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:35:52,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:35:52,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:35:52,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:35:52,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:35:52,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:35:52,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:35:52,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:35:52,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:35:52,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:35:52,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:35:52,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:35:52,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:35:52,958 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:35:52,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:35:52,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:35:52,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:35:52,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:35:52,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:35:52,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:35:52,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:35:52,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:35:52,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:35:52,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:35:52,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:35:52,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:35:52,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:35:52,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:35:52,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:35:52,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:35:52,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:35:52,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:52,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:35:52,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:35:52,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:35:52,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:35:52,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:35:52,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:35:52,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:35:52,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:35:52,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:35:52,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:35:53,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:35:53,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:35:53,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:35:53,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:35:53,267 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:35:53,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-18 15:35:54,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:35:54,827 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:35:54,827 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2024-09-18 15:35:54,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6e0be3d7e/fcdc7628cf7c4661a24193bba0d634e7/FLAG773bbe977 [2024-09-18 15:35:54,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6e0be3d7e/fcdc7628cf7c4661a24193bba0d634e7 [2024-09-18 15:35:54,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:35:54,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:35:54,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:54,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:35:54,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:35:54,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:54" (1/1) ... [2024-09-18 15:35:54,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ee863c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:54, skipping insertion in model container [2024-09-18 15:35:54,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:54" (1/1) ... [2024-09-18 15:35:54,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:35:55,046 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-18 15:35:55,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-18 15:35:55,053 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-18 15:35:55,054 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-18 15:35:55,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-18 15:35:55,059 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-18 15:35:55,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-18 15:35:55,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-18 15:35:55,065 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-18 15:35:55,066 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-18 15:35:55,069 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-18 15:35:55,070 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-18 15:35:55,072 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-18 15:35:55,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-18 15:35:55,076 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-18 15:35:55,077 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-18 15:35:55,079 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-18 15:35:55,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:55,095 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:35:55,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2024-09-18 15:35:55,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2024-09-18 15:35:55,111 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2024-09-18 15:35:55,113 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2024-09-18 15:35:55,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2024-09-18 15:35:55,116 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2024-09-18 15:35:55,117 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2024-09-18 15:35:55,118 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2024-09-18 15:35:55,120 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2024-09-18 15:35:55,121 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2024-09-18 15:35:55,123 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2024-09-18 15:35:55,124 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2024-09-18 15:35:55,127 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2024-09-18 15:35:55,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2024-09-18 15:35:55,134 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2024-09-18 15:35:55,135 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2024-09-18 15:35:55,137 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2024-09-18 15:35:55,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:55,158 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:35:55,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55 WrapperNode [2024-09-18 15:35:55,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:55,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:55,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:35:55,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:35:55,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,188 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:35:55,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:55,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:35:55,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:35:55,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:35:55,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,235 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-18 15:35:55,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:35:55,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:35:55,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:35:55,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:35:55,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (1/1) ... [2024-09-18 15:35:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:55,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:35:55,301 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-18 15:35:55,303 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-18 15:35:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:35:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:35:55,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:35:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:35:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:35:55,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:35:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:35:55,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:35:55,500 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:35:55,503 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:35:55,785 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-09-18 15:35:55,785 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:35:55,820 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:35:55,820 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-18 15:35:55,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:55 BoogieIcfgContainer [2024-09-18 15:35:55,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:35:55,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:35:55,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:35:55,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:35:55,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:35:54" (1/3) ... [2024-09-18 15:35:55,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd153c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:55, skipping insertion in model container [2024-09-18 15:35:55,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:55" (2/3) ... [2024-09-18 15:35:55,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd153c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:55, skipping insertion in model container [2024-09-18 15:35:55,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:55" (3/3) ... [2024-09-18 15:35:55,828 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2024-09-18 15:35:55,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:35:55,840 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-09-18 15:35:55,889 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:35:55,896 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;@74ca43f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:35:55,896 INFO L337 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-09-18 15:35:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:35:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-18 15:35:55,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:55,912 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:55,913 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:55,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2024-09-18 15:35:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:55,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384970087] [2024-09-18 15:35:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,337 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-18 15:35:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384970087] [2024-09-18 15:35:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384970087] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776438910] [2024-09-18 15:35:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,343 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:56,364 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:56,618 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-09-18 15:35:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:56,621 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-18 15:35:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:56,632 INFO L225 Difference]: With dead ends: 91 [2024-09-18 15:35:56,633 INFO L226 Difference]: Without dead ends: 76 [2024-09-18 15:35:56,637 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-18 15:35:56,640 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:56,640 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:35:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-18 15:35:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2024-09-18 15:35:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-18 15:35:56,690 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2024-09-18 15:35:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:56,691 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-18 15:35:56,691 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-18 15:35:56,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-18 15:35:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-18 15:35:56,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:56,694 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:56,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:35:56,695 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:56,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2024-09-18 15:35:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328955124] [2024-09-18 15:35:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:35:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328955124] [2024-09-18 15:35:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328955124] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353108739] [2024-09-18 15:35:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:56,828 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:56,997 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-18 15:35:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:56,998 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-18 15:35:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:56,999 INFO L225 Difference]: With dead ends: 68 [2024-09-18 15:35:56,999 INFO L226 Difference]: Without dead ends: 66 [2024-09-18 15:35:56,999 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:57,000 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,001 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 90 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-18 15:35:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-18 15:35:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-18 15:35:57,039 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2024-09-18 15:35:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,040 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-18 15:35:57,040 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-18 15:35:57,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-18 15:35:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-18 15:35:57,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,041 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:35:57,042 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:57,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2024-09-18 15:35:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46367149] [2024-09-18 15:35:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,183 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-18 15:35:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46367149] [2024-09-18 15:35:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46367149] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360041350] [2024-09-18 15:35:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:57,190 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,337 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-18 15:35:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-18 15:35:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,339 INFO L225 Difference]: With dead ends: 72 [2024-09-18 15:35:57,339 INFO L226 Difference]: Without dead ends: 70 [2024-09-18 15:35:57,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:57,341 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-18 15:35:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-09-18 15:35:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-09-18 15:35:57,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2024-09-18 15:35:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,360 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-09-18 15:35:57,361 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-09-18 15:35:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-18 15:35:57,365 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,366 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-18 15:35:57,366 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:57,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2024-09-18 15:35:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751022219] [2024-09-18 15:35:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,460 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-18 15:35:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751022219] [2024-09-18 15:35:57,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751022219] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378190578] [2024-09-18 15:35:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,462 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:57,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:57,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,463 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,614 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-18 15:35:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:57,614 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-18 15:35:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,615 INFO L225 Difference]: With dead ends: 70 [2024-09-18 15:35:57,615 INFO L226 Difference]: Without dead ends: 68 [2024-09-18 15:35:57,615 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-18 15:35:57,616 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-18 15:35:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-18 15:35:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-09-18 15:35:57,628 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2024-09-18 15:35:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,628 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-09-18 15:35:57,629 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-18 15:35:57,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-09-18 15:35:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-18 15:35:57,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,630 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-18 15:35:57,630 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:57,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2024-09-18 15:35:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016631623] [2024-09-18 15:35:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,712 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-18 15:35:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016631623] [2024-09-18 15:35:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016631623] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784500832] [2024-09-18 15:35:57,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,714 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,869 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-18 15:35:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:57,870 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-18 15:35:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,871 INFO L225 Difference]: With dead ends: 68 [2024-09-18 15:35:57,871 INFO L226 Difference]: Without dead ends: 66 [2024-09-18 15:35:57,872 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-18 15:35:57,875 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 117 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-18 15:35:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-09-18 15:35:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-09-18 15:35:57,898 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2024-09-18 15:35:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,898 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-09-18 15:35:57,898 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-18 15:35:57,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-09-18 15:35:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:57,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,904 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,904 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-18 15:35:57,904 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:57,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2024-09-18 15:35:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725007549] [2024-09-18 15:35:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,979 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-18 15:35:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725007549] [2024-09-18 15:35:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725007549] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898657312] [2024-09-18 15:35:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,980 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:57,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,981 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,133 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-18 15:35:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:58,133 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-18 15:35:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,135 INFO L225 Difference]: With dead ends: 66 [2024-09-18 15:35:58,135 INFO L226 Difference]: Without dead ends: 64 [2024-09-18 15:35:58,136 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-18 15:35:58,136 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,137 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 111 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-18 15:35:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-09-18 15:35:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-09-18 15:35:58,149 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2024-09-18 15:35:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,149 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-09-18 15:35:58,149 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-18 15:35:58,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-09-18 15:35:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:58,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,151 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-18 15:35:58,151 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:58,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2024-09-18 15:35:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093385502] [2024-09-18 15:35:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,288 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-18 15:35:58,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093385502] [2024-09-18 15:35:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093385502] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742256894] [2024-09-18 15:35:58,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,289 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:58,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:58,290 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,396 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-18 15:35:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:58,397 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-18 15:35:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,397 INFO L225 Difference]: With dead ends: 64 [2024-09-18 15:35:58,398 INFO L226 Difference]: Without dead ends: 60 [2024-09-18 15:35:58,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:58,399 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-18 15:35:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-18 15:35:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-09-18 15:35:58,414 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2024-09-18 15:35:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,415 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-09-18 15:35:58,415 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-18 15:35:58,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-09-18 15:35:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:58,417 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,418 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,418 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-18 15:35:58,418 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:58,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2024-09-18 15:35:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113022326] [2024-09-18 15:35:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,475 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-18 15:35:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113022326] [2024-09-18 15:35:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113022326] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834880793] [2024-09-18 15:35:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:58,480 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,580 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-18 15:35:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:58,581 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-18 15:35:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,582 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:35:58,582 INFO L226 Difference]: Without dead ends: 56 [2024-09-18 15:35:58,582 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-18 15:35:58,583 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,583 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-18 15:35:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-18 15:35:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-09-18 15:35:58,595 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2024-09-18 15:35:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,596 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-09-18 15:35:58,596 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-18 15:35:58,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-09-18 15:35:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:58,597 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,597 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,597 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-18 15:35:58,597 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:58,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2024-09-18 15:35:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488651752] [2024-09-18 15:35:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,740 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-18 15:35:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488651752] [2024-09-18 15:35:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488651752] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851029] [2024-09-18 15:35:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,741 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:58,743 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,894 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-18 15:35:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:58,894 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-18 15:35:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,896 INFO L225 Difference]: With dead ends: 88 [2024-09-18 15:35:58,896 INFO L226 Difference]: Without dead ends: 86 [2024-09-18 15:35:58,896 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-18 15:35:58,897 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-18 15:35:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2024-09-18 15:35:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-09-18 15:35:58,912 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2024-09-18 15:35:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,912 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-09-18 15:35:58,912 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-18 15:35:58,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-09-18 15:35:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:58,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,913 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-18 15:35:58,914 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:58,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2024-09-18 15:35:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876378406] [2024-09-18 15:35:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,991 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-18 15:35:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876378406] [2024-09-18 15:35:58,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876378406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205943270] [2024-09-18 15:35:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,992 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:58,993 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,125 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-18 15:35:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:59,126 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-18 15:35:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,127 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:35:59,127 INFO L226 Difference]: Without dead ends: 58 [2024-09-18 15:35:59,127 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-18 15:35:59,128 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,128 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-18 15:35:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-18 15:35:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-09-18 15:35:59,143 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 16 [2024-09-18 15:35:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,144 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-09-18 15:35:59,145 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-18 15:35:59,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-09-18 15:35:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:59,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,147 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:59,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-18 15:35:59,147 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:59,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2024-09-18 15:35:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697069492] [2024-09-18 15:35:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,234 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-18 15:35:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697069492] [2024-09-18 15:35:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697069492] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959494820] [2024-09-18 15:35:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:59,237 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,353 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-18 15:35:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:59,353 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-18 15:35:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,354 INFO L225 Difference]: With dead ends: 58 [2024-09-18 15:35:59,354 INFO L226 Difference]: Without dead ends: 56 [2024-09-18 15:35:59,354 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-18 15:35:59,355 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,355 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 83 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-18 15:35:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-18 15:35:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-09-18 15:35:59,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2024-09-18 15:35:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,371 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-09-18 15:35:59,371 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-18 15:35:59,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-09-18 15:35:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:59,372 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,372 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:59,372 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-18 15:35:59,372 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:59,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2024-09-18 15:35:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327370256] [2024-09-18 15:35:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,507 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-18 15:35:59,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327370256] [2024-09-18 15:35:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327370256] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329059753] [2024-09-18 15:35:59,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:59,509 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,662 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-09-18 15:35:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-18 15:35:59,662 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-18 15:35:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,663 INFO L225 Difference]: With dead ends: 78 [2024-09-18 15:35:59,663 INFO L226 Difference]: Without dead ends: 76 [2024-09-18 15:35:59,664 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:35:59,664 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,665 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 106 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-18 15:35:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2024-09-18 15:35:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-09-18 15:35:59,674 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2024-09-18 15:35:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,675 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-09-18 15:35:59,675 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-18 15:35:59,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-09-18 15:35:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:59,678 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,678 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:59,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-18 15:35:59,679 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:59,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2024-09-18 15:35:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533186222] [2024-09-18 15:35:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,749 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-18 15:35:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533186222] [2024-09-18 15:35:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533186222] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80443095] [2024-09-18 15:35:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,752 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:59,753 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,868 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-09-18 15:35:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:59,869 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-18 15:35:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,869 INFO L225 Difference]: With dead ends: 59 [2024-09-18 15:35:59,869 INFO L226 Difference]: Without dead ends: 57 [2024-09-18 15:35:59,870 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-18 15:35:59,870 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,870 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-18 15:35:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-09-18 15:35:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-09-18 15:35:59,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2024-09-18 15:35:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,881 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-09-18 15:35:59,881 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-18 15:35:59,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-09-18 15:35:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:59,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,882 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:59,882 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-18 15:35:59,882 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:35:59,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2024-09-18 15:35:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567220381] [2024-09-18 15:35:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,043 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-18 15:36:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567220381] [2024-09-18 15:36:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567220381] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329140599] [2024-09-18 15:36:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:00,045 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:00,193 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-18 15:36:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:00,194 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-18 15:36:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:00,194 INFO L225 Difference]: With dead ends: 72 [2024-09-18 15:36:00,195 INFO L226 Difference]: Without dead ends: 70 [2024-09-18 15:36:00,195 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-18 15:36:00,195 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:00,196 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-18 15:36:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-09-18 15:36:00,204 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-18 15:36:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-18 15:36:00,205 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-18 15:36:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:00,206 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-18 15:36:00,206 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-18 15:36:00,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-18 15:36:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:36:00,207 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:00,207 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:36:00,207 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-18 15:36:00,207 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:00,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2024-09-18 15:36:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406348954] [2024-09-18 15:36:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,320 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-18 15:36:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406348954] [2024-09-18 15:36:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406348954] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686212368] [2024-09-18 15:36:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:00,323 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:00,461 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-18 15:36:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:00,462 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-18 15:36:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:00,462 INFO L225 Difference]: With dead ends: 73 [2024-09-18 15:36:00,462 INFO L226 Difference]: Without dead ends: 69 [2024-09-18 15:36:00,464 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-18 15:36:00,464 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:00,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 121 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-18 15:36:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-09-18 15:36:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-18 15:36:00,474 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2024-09-18 15:36:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:00,476 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-18 15:36:00,476 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-18 15:36:00,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-18 15:36:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-18 15:36:00,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:00,477 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-18 15:36:00,477 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-18 15:36:00,477 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:00,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2024-09-18 15:36:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827562788] [2024-09-18 15:36:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,578 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-18 15:36:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827562788] [2024-09-18 15:36:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827562788] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375312785] [2024-09-18 15:36:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:00,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:00,580 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:00,725 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-18 15:36:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:00,725 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-18 15:36:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:00,726 INFO L225 Difference]: With dead ends: 69 [2024-09-18 15:36:00,726 INFO L226 Difference]: Without dead ends: 67 [2024-09-18 15:36:00,726 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-18 15:36:00,727 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:00,727 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-18 15:36:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-18 15:36:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-09-18 15:36:00,738 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 18 [2024-09-18 15:36:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:00,738 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-09-18 15:36:00,738 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-18 15:36:00,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-09-18 15:36:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-18 15:36:00,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:00,740 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-18 15:36:00,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-18 15:36:00,740 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:00,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2024-09-18 15:36:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086833600] [2024-09-18 15:36:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,799 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-18 15:36:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086833600] [2024-09-18 15:36:00,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086833600] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:00,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:00,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:36:00,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118264438] [2024-09-18 15:36:00,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:36:00,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:36:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:36:00,801 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:00,883 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-09-18 15:36:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:36:00,883 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-18 15:36:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:00,884 INFO L225 Difference]: With dead ends: 66 [2024-09-18 15:36:00,884 INFO L226 Difference]: Without dead ends: 64 [2024-09-18 15:36:00,884 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-18 15:36:00,885 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:00,885 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 68 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-18 15:36:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-09-18 15:36:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-09-18 15:36:00,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 19 [2024-09-18 15:36:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:00,894 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-09-18 15:36:00,895 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-18 15:36:00,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-09-18 15:36:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-18 15:36:00,895 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:00,895 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-18 15:36:00,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-18 15:36:00,896 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:00,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2024-09-18 15:36:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457096406] [2024-09-18 15:36:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,942 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-18 15:36:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457096406] [2024-09-18 15:36:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457096406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:36:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683316212] [2024-09-18 15:36:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,943 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:36:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:36:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:36:00,944 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:01,028 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-09-18 15:36:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:36:01,028 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-18 15:36:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:01,029 INFO L225 Difference]: With dead ends: 64 [2024-09-18 15:36:01,029 INFO L226 Difference]: Without dead ends: 60 [2024-09-18 15:36:01,029 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-18 15:36:01,030 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:01,030 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-18 15:36:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-18 15:36:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-09-18 15:36:01,040 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 20 [2024-09-18 15:36:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:01,040 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-09-18 15:36:01,040 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-18 15:36:01,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-09-18 15:36:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:36:01,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:01,041 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:36:01,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-18 15:36:01,041 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:01,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 911253964, now seen corresponding path program 1 times [2024-09-18 15:36:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332944611] [2024-09-18 15:36:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,139 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-18 15:36:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332944611] [2024-09-18 15:36:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332944611] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:36:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640095260] [2024-09-18 15:36:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:36:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:36:01,141 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-18 15:36:01,143 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-18 15:36:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-18 15:36:01,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:36:01,456 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-18 15:36:01,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:36:01,571 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-18 15:36:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640095260] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:36:01,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:36:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-18 15:36:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874416810] [2024-09-18 15:36:01,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:36:01,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-18 15:36:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-18 15:36:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-18 15:36:01,574 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:01,851 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-18 15:36:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-18 15:36:01,852 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-18 15:36:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:01,853 INFO L225 Difference]: With dead ends: 86 [2024-09-18 15:36:01,853 INFO L226 Difference]: Without dead ends: 84 [2024-09-18 15:36:01,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-18 15:36:01,854 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 407 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:01,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 113 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:36:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-18 15:36:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2024-09-18 15:36:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-09-18 15:36:01,865 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2024-09-18 15:36:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:01,865 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-09-18 15:36:01,865 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-18 15:36:01,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-09-18 15:36:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:36:01,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:01,866 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-18 15:36:01,884 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-18 15:36:02,070 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-18 15:36:02,071 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:02,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1524331500, now seen corresponding path program 1 times [2024-09-18 15:36:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:02,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238383738] [2024-09-18 15:36:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,164 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-18 15:36:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238383738] [2024-09-18 15:36:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238383738] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261594275] [2024-09-18 15:36:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:02,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:02,166 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:02,278 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-09-18 15:36:02,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:02,279 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-18 15:36:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:02,279 INFO L225 Difference]: With dead ends: 56 [2024-09-18 15:36:02,279 INFO L226 Difference]: Without dead ends: 54 [2024-09-18 15:36:02,280 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-18 15:36:02,280 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:02,280 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 46 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-18 15:36:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-09-18 15:36:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-09-18 15:36:02,290 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 21 [2024-09-18 15:36:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:02,290 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-09-18 15:36:02,290 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-18 15:36:02,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-09-18 15:36:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:36:02,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:02,291 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-18 15:36:02,291 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-18 15:36:02,291 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:02,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -682220907, now seen corresponding path program 1 times [2024-09-18 15:36:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640772872] [2024-09-18 15:36:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,391 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-18 15:36:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640772872] [2024-09-18 15:36:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640772872] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754902760] [2024-09-18 15:36:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:02,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:02,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:02,392 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:02,501 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-09-18 15:36:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-18 15:36:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:02,502 INFO L225 Difference]: With dead ends: 51 [2024-09-18 15:36:02,502 INFO L226 Difference]: Without dead ends: 49 [2024-09-18 15:36:02,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:36:02,503 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:02,503 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-18 15:36:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-09-18 15:36:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-09-18 15:36:02,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2024-09-18 15:36:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:02,512 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-09-18 15:36:02,512 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-09-18 15:36:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:36:02,513 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:02,513 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-18 15:36:02,513 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-18 15:36:02,513 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:02,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -634505657, now seen corresponding path program 1 times [2024-09-18 15:36:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107646569] [2024-09-18 15:36:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:36:02,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107646569] [2024-09-18 15:36:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107646569] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:02,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769397555] [2024-09-18 15:36:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:02,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:02,610 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:02,710 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-09-18 15:36:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-18 15:36:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:02,711 INFO L225 Difference]: With dead ends: 46 [2024-09-18 15:36:02,711 INFO L226 Difference]: Without dead ends: 23 [2024-09-18 15:36:02,711 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:36:02,712 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:02,712 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-18 15:36:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-18 15:36:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-09-18 15:36:02,717 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2024-09-18 15:36:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:02,717 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-09-18 15:36:02,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:02,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-09-18 15:36:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:36:02,718 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:02,718 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:36:02,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-18 15:36:02,718 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-09-18 15:36:02,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1822144134, now seen corresponding path program 1 times [2024-09-18 15:36:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:02,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19860641] [2024-09-18 15:36:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,806 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-18 15:36:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19860641] [2024-09-18 15:36:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19860641] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:36:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130250623] [2024-09-18 15:36:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:36:02,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:36:02,808 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-18 15:36:02,810 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-18 15:36:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-18 15:36:02,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:36:03,054 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-18 15:36:03,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:36:03,145 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-18 15:36:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130250623] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:36:03,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:36:03,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-18 15:36:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106464496] [2024-09-18 15:36:03,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:36:03,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-18 15:36:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-18 15:36:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-18 15:36:03,147 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:03,290 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-18 15:36:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-18 15:36:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-18 15:36:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:03,291 INFO L225 Difference]: With dead ends: 34 [2024-09-18 15:36:03,291 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 15:36:03,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-09-18 15:36:03,293 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:03,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 15:36:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 15:36:03,294 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-18 15:36:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 15:36:03,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-18 15:36:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:03,294 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 15:36:03,294 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:03,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 15:36:03,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 15:36:03,297 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2024-09-18 15:36:03,298 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2024-09-18 15:36:03,298 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2024-09-18 15:36:03,298 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2024-09-18 15:36:03,298 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2024-09-18 15:36:03,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2024-09-18 15:36:03,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2024-09-18 15:36:03,300 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2024-09-18 15:36:03,317 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-18 15:36:03,500 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-18 15:36:03,504 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-18 15:36:03,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 15:36:05,153 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 15:36:05,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 03:36:05 BoogieIcfgContainer [2024-09-18 15:36:05,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-18 15:36:05,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-18 15:36:05,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-18 15:36:05,171 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-18 15:36:05,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:55" (3/4) ... [2024-09-18 15:36:05,174 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-18 15:36:05,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-18 15:36:05,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-18 15:36:05,234 INFO L158 Benchmark]: Toolchain (without parser) took 10376.36ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 132.4MB in the beginning and 74.9MB in the end (delta: 57.4MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,234 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:36:05,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.73ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 114.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.98ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,235 INFO L158 Benchmark]: Boogie Preprocessor took 71.24ms. Allocated memory is still 172.0MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,235 INFO L158 Benchmark]: RCFGBuilder took 560.33ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 125.2MB in the end (delta: -14.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,235 INFO L158 Benchmark]: TraceAbstraction took 9347.73ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 124.8MB in the beginning and 77.0MB in the end (delta: 47.8MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,236 INFO L158 Benchmark]: Witness Printer took 59.87ms. Allocated memory is still 207.6MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:36:05,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.73ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 114.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.98ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.24ms. Allocated memory is still 172.0MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 560.33ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 125.2MB in the end (delta: -14.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9347.73ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 124.8MB in the beginning and 77.0MB in the end (delta: 47.8MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Witness Printer took 59.87ms. Allocated memory is still 207.6MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 56]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 73]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 115]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 127]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 143]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 155]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 189]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 225]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 237]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 279]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 298]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 310]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 339]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 351]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 2244 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 698 mSDtfsCounter, 2988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 112 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1890 SizeOfPredicates, 6 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 64]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 283]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || ((main__t == 0) && (1 <= main__tagbuf_len))) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) || (((main__tagbuf_len != main__t) && (main__t == 0)) && (main__t <= main__tagbuf_len))) - InvariantResult [Line: 102]: Location Invariant Derived location invariant: (((main__tagbuf_len != main__t) && (1 <= main__t)) && (main__t <= main__tagbuf_len)) RESULT: Ultimate proved your program to be correct! [2024-09-18 15:36:05,262 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