./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-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 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 18:42:00,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 18:42:00,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 18:42:00,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 18:42:00,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 18:42:00,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 18:42:00,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 18:42:00,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 18:42:00,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 18:42:00,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 18:42:00,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 18:42:00,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 18:42:00,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 18:42:00,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 18:42:00,647 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 18:42:00,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 18:42:00,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 18:42:00,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 18:42:00,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 18:42:00,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 18:42:00,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 18:42:00,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 18:42:00,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 18:42:00,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 18:42:00,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 18:42:00,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 18:42:00,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 18:42:00,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 18:42:00,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 18:42:00,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 18:42:00,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 18:42:00,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 18:42:00,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:42:00,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 18:42:00,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 18:42:00,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 18:42:00,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 18:42:00,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 18:42:00,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 18:42:00,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 18:42:00,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 18:42:00,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 18:42:00,669 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 -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-15 18:42:00,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 18:42:00,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 18:42:00,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 18:42:00,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 18:42:00,898 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 18:42:00,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-09-15 18:42:02,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 18:42:02,920 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 18:42:02,921 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-09-15 18:42:02,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7a090738c/f01390e3bfe64412ba78eddb16a9b174/FLAG01d270e33 [2024-09-15 18:42:02,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7a090738c/f01390e3bfe64412ba78eddb16a9b174 [2024-09-15 18:42:02,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 18:42:02,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 18:42:02,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 18:42:02,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 18:42:02,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 18:42:02,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:42:02" (1/1) ... [2024-09-15 18:42:02,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece0641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:02, skipping insertion in model container [2024-09-15 18:42:02,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:42:02" (1/1) ... [2024-09-15 18:42:03,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 18:42:03,262 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.p+sep-reducer.c[1000,1013] [2024-09-15 18:42:03,267 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2024-09-15 18:42:03,533 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.p+sep-reducer.c[83573,83586] [2024-09-15 18:42:03,535 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.p+sep-reducer.c[83794,83807] [2024-09-15 18:42:03,542 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.p+sep-reducer.c[84257,84270] [2024-09-15 18:42:03,544 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.p+sep-reducer.c[84478,84491] [2024-09-15 18:42:03,548 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.p+sep-reducer.c[84801,84814] [2024-09-15 18:42:03,550 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.p+sep-reducer.c[85022,85035] [2024-09-15 18:42:03,554 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.p+sep-reducer.c[85521,85534] [2024-09-15 18:42:03,556 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.p+sep-reducer.c[85742,85755] [2024-09-15 18:42:03,561 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.p+sep-reducer.c[86050,86063] [2024-09-15 18:42:03,563 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.p+sep-reducer.c[86271,86284] [2024-09-15 18:42:03,566 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.p+sep-reducer.c[86594,86607] [2024-09-15 18:42:03,569 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.p+sep-reducer.c[86815,86828] [2024-09-15 18:42:03,572 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.p+sep-reducer.c[87258,87271] [2024-09-15 18:42:03,574 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.p+sep-reducer.c[87479,87492] [2024-09-15 18:42:03,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:42:03,613 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 18:42:03,623 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.p+sep-reducer.c[1000,1013] [2024-09-15 18:42:03,628 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.p+sep-reducer.c[1215,1228] [2024-09-15 18:42:03,809 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.p+sep-reducer.c[83573,83586] [2024-09-15 18:42:03,812 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.p+sep-reducer.c[83794,83807] [2024-09-15 18:42:03,816 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.p+sep-reducer.c[84257,84270] [2024-09-15 18:42:03,819 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.p+sep-reducer.c[84478,84491] [2024-09-15 18:42:03,822 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.p+sep-reducer.c[84801,84814] [2024-09-15 18:42:03,828 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.p+sep-reducer.c[85022,85035] [2024-09-15 18:42:03,832 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.p+sep-reducer.c[85521,85534] [2024-09-15 18:42:03,836 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.p+sep-reducer.c[85742,85755] [2024-09-15 18:42:03,840 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.p+sep-reducer.c[86050,86063] [2024-09-15 18:42:03,843 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.p+sep-reducer.c[86271,86284] [2024-09-15 18:42:03,846 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.p+sep-reducer.c[86594,86607] [2024-09-15 18:42:03,850 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.p+sep-reducer.c[86815,86828] [2024-09-15 18:42:03,853 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.p+sep-reducer.c[87258,87271] [2024-09-15 18:42:03,857 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.p+sep-reducer.c[87479,87492] [2024-09-15 18:42:03,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:42:03,879 INFO L204 MainTranslator]: Completed translation [2024-09-15 18:42:03,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03 WrapperNode [2024-09-15 18:42:03,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 18:42:03,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 18:42:03,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 18:42:03,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 18:42:03,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,932 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 18:42:03,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 18:42:03,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 18:42:03,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 18:42:03,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 18:42:03,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,989 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 18:42:03,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:03,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 18:42:04,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 18:42:04,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 18:42:04,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 18:42:04,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (1/1) ... [2024-09-15 18:42:04,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:42:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 18:42:04,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 18:42:04,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 18:42:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 18:42:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 18:42:04,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 18:42:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 18:42:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 18:42:04,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 18:42:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 18:42:04,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 18:42:04,371 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 18:42:04,373 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 18:42:05,821 INFO L? ?]: Removed 1159 outVars from TransFormulas that were not future-live. [2024-09-15 18:42:05,821 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 18:42:05,850 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 18:42:05,850 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 18:42:05,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05 BoogieIcfgContainer [2024-09-15 18:42:05,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 18:42:05,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 18:42:05,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 18:42:05,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 18:42:05,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 06:42:02" (1/3) ... [2024-09-15 18:42:05,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593bcfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:42:05, skipping insertion in model container [2024-09-15 18:42:05,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:42:03" (2/3) ... [2024-09-15 18:42:05,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593bcfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:42:05, skipping insertion in model container [2024-09-15 18:42:05,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05" (3/3) ... [2024-09-15 18:42:05,857 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2024-09-15 18:42:05,871 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 18:42:05,871 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-15 18:42:05,926 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 18:42:05,932 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;@6599de90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 18:42:05,933 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-15 18:42:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 479 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 18:42:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-15 18:42:05,944 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:05,945 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:05,945 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:05,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2024-09-15 18:42:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12015945] [2024-09-15 18:42:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12015945] [2024-09-15 18:42:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12015945] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279900006] [2024-09-15 18:42:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:06,282 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:06,305 INFO L87 Difference]: Start difference. First operand has 479 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 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.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:08,170 INFO L93 Difference]: Finished difference Result 495 states and 922 transitions. [2024-09-15 18:42:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 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 10 [2024-09-15 18:42:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:08,181 INFO L225 Difference]: With dead ends: 495 [2024-09-15 18:42:08,182 INFO L226 Difference]: Without dead ends: 305 [2024-09-15 18:42:08,185 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:08,187 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 1402 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:08,188 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 191 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-15 18:42:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-09-15 18:42:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2024-09-15 18:42:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 296 states have internal predecessors, (360), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2024-09-15 18:42:08,288 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2024-09-15 18:42:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:08,288 INFO L474 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2024-09-15 18:42:08,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:08,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2024-09-15 18:42:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-15 18:42:08,290 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:08,290 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:08,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 18:42:08,290 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:08,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2024-09-15 18:42:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798563388] [2024-09-15 18:42:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798563388] [2024-09-15 18:42:08,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798563388] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:08,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:42:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266298769] [2024-09-15 18:42:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:08,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:42:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:42:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:08,471 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:09,719 INFO L93 Difference]: Finished difference Result 303 states and 366 transitions. [2024-09-15 18:42:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-15 18:42:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:09,724 INFO L225 Difference]: With dead ends: 303 [2024-09-15 18:42:09,731 INFO L226 Difference]: Without dead ends: 295 [2024-09-15 18:42:09,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:09,733 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 315 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:09,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 145 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-15 18:42:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-15 18:42:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-15 18:42:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 278 states have (on average 1.0611510791366907) internal successors, (295), 291 states have internal predecessors, (295), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2024-09-15 18:42:09,828 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2024-09-15 18:42:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:09,830 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2024-09-15 18:42:09,833 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:09,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2024-09-15 18:42:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-15 18:42:09,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:09,852 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:09,853 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 18:42:09,853 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:09,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2024-09-15 18:42:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305405060] [2024-09-15 18:42:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:13,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305405060] [2024-09-15 18:42:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305405060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2024-09-15 18:42:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396719276] [2024-09-15 18:42:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:13,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-09-15 18:42:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-09-15 18:42:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2024-09-15 18:42:13,512 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:16,458 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2024-09-15 18:42:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-15 18:42:16,459 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 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 247 [2024-09-15 18:42:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:16,461 INFO L225 Difference]: With dead ends: 295 [2024-09-15 18:42:16,461 INFO L226 Difference]: Without dead ends: 293 [2024-09-15 18:42:16,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2024-09-15 18:42:16,466 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 395 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:16,467 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 148 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-15 18:42:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-15 18:42:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-09-15 18:42:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 277 states have (on average 1.0577617328519855) internal successors, (293), 289 states have internal predecessors, (293), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2024-09-15 18:42:16,522 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2024-09-15 18:42:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:16,523 INFO L474 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2024-09-15 18:42:16,523 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:16,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2024-09-15 18:42:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-15 18:42:16,529 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:16,530 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:16,530 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 18:42:16,530 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:16,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2024-09-15 18:42:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320461845] [2024-09-15 18:42:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:22,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320461845] [2024-09-15 18:42:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320461845] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172277797] [2024-09-15 18:42:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:22,360 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:22,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:22,361 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:22,821 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2024-09-15 18:42:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 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 248 [2024-09-15 18:42:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:22,824 INFO L225 Difference]: With dead ends: 293 [2024-09-15 18:42:22,824 INFO L226 Difference]: Without dead ends: 291 [2024-09-15 18:42:22,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:42:22,825 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:22,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 87 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 18:42:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-09-15 18:42:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-09-15 18:42:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 276 states have (on average 1.0543478260869565) internal successors, (291), 287 states have internal predecessors, (291), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2024-09-15 18:42:22,863 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2024-09-15 18:42:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:22,863 INFO L474 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2024-09-15 18:42:22,863 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:22,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2024-09-15 18:42:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-09-15 18:42:22,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:22,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 18:42:22,867 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:22,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2024-09-15 18:42:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140233988] [2024-09-15 18:42:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:25,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140233988] [2024-09-15 18:42:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140233988] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2024-09-15 18:42:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123246474] [2024-09-15 18:42:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:25,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-09-15 18:42:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:25,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-09-15 18:42:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1897, Invalid=2263, Unknown=0, NotChecked=0, Total=4160 [2024-09-15 18:42:25,575 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand has 65 states, 65 states have (on average 3.8153846153846156) internal successors, (248), 64 states have internal predecessors, (248), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:28,355 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2024-09-15 18:42:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-15 18:42:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8153846153846156) internal successors, (248), 64 states have internal predecessors, (248), 1 states have call successors, (2), 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 251 [2024-09-15 18:42:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:28,357 INFO L225 Difference]: With dead ends: 294 [2024-09-15 18:42:28,357 INFO L226 Difference]: Without dead ends: 292 [2024-09-15 18:42:28,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2007 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5622, Invalid=10128, Unknown=0, NotChecked=0, Total=15750 [2024-09-15 18:42:28,361 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 369 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:28,361 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 109 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-15 18:42:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-15 18:42:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-09-15 18:42:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 275 states have (on average 1.050909090909091) internal successors, (289), 285 states have internal predecessors, (289), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2024-09-15 18:42:28,397 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2024-09-15 18:42:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:28,398 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2024-09-15 18:42:28,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8153846153846156) internal successors, (248), 64 states have internal predecessors, (248), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:28,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2024-09-15 18:42:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-09-15 18:42:28,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:28,401 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:28,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 18:42:28,401 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:28,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2024-09-15 18:42:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640188935] [2024-09-15 18:42:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:32,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:32,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640188935] [2024-09-15 18:42:32,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640188935] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621855673] [2024-09-15 18:42:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:32,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:32,907 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 8 states, 8 states have (on average 31.125) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:33,379 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2024-09-15 18:42:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.125) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 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 252 [2024-09-15 18:42:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:33,381 INFO L225 Difference]: With dead ends: 289 [2024-09-15 18:42:33,381 INFO L226 Difference]: Without dead ends: 287 [2024-09-15 18:42:33,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:42:33,382 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 325 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:33,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 92 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 18:42:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-15 18:42:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-09-15 18:42:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 274 states have (on average 1.0474452554744527) internal successors, (287), 283 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2024-09-15 18:42:33,416 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2024-09-15 18:42:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:33,417 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2024-09-15 18:42:33,417 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.125) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:33,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2024-09-15 18:42:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-09-15 18:42:33,419 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:33,419 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:33,419 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 18:42:33,420 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:33,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2024-09-15 18:42:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737421337] [2024-09-15 18:42:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:33,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737421337] [2024-09-15 18:42:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737421337] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58735793] [2024-09-15 18:42:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:33,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:33,669 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:34,065 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2024-09-15 18:42:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:34,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 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 254 [2024-09-15 18:42:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:34,068 INFO L225 Difference]: With dead ends: 287 [2024-09-15 18:42:34,068 INFO L226 Difference]: Without dead ends: 285 [2024-09-15 18:42:34,069 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:42:34,069 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 267 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:34,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 80 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 18:42:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-09-15 18:42:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-09-15 18:42:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 273 states have (on average 1.043956043956044) internal successors, (285), 281 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2024-09-15 18:42:34,106 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2024-09-15 18:42:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:34,107 INFO L474 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2024-09-15 18:42:34,107 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2024-09-15 18:42:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-09-15 18:42:34,108 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:34,108 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:34,109 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 18:42:34,109 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:34,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2024-09-15 18:42:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616880645] [2024-09-15 18:42:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:34,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616880645] [2024-09-15 18:42:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616880645] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:42:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849126473] [2024-09-15 18:42:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:34,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:42:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:42:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:42:34,325 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:34,808 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2024-09-15 18:42:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:42:34,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (2), 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 255 [2024-09-15 18:42:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:34,811 INFO L225 Difference]: With dead ends: 285 [2024-09-15 18:42:34,811 INFO L226 Difference]: Without dead ends: 281 [2024-09-15 18:42:34,811 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:42:34,812 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 244 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:34,812 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 109 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 18:42:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-15 18:42:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-09-15 18:42:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 270 states have (on average 1.0407407407407407) internal successors, (281), 277 states have internal predecessors, (281), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2024-09-15 18:42:34,846 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2024-09-15 18:42:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:34,846 INFO L474 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2024-09-15 18:42:34,846 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:34,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2024-09-15 18:42:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-09-15 18:42:34,847 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:34,847 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:34,848 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 18:42:34,848 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:34,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2024-09-15 18:42:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709294526] [2024-09-15 18:42:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:37,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:37,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709294526] [2024-09-15 18:42:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709294526] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-09-15 18:42:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98856009] [2024-09-15 18:42:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:37,252 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-15 18:42:37,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-15 18:42:37,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-09-15 18:42:37,259 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:39,994 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2024-09-15 18:42:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-09-15 18:42:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 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 256 [2024-09-15 18:42:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:39,996 INFO L225 Difference]: With dead ends: 291 [2024-09-15 18:42:39,996 INFO L226 Difference]: Without dead ends: 289 [2024-09-15 18:42:40,000 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2024-09-15 18:42:40,000 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 331 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:40,000 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 106 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-15 18:42:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-09-15 18:42:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2024-09-15 18:42:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 269 states have (on average 1.037174721189591) internal successors, (279), 275 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2024-09-15 18:42:40,036 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2024-09-15 18:42:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:40,036 INFO L474 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2024-09-15 18:42:40,036 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:40,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2024-09-15 18:42:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-09-15 18:42:40,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:40,038 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:40,038 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 18:42:40,038 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:40,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2024-09-15 18:42:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816054874] [2024-09-15 18:42:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:42,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816054874] [2024-09-15 18:42:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816054874] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-09-15 18:42:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302452265] [2024-09-15 18:42:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:42,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-15 18:42:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-15 18:42:42,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-09-15 18:42:42,334 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:44,963 INFO L93 Difference]: Finished difference Result 289 states and 293 transitions. [2024-09-15 18:42:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-09-15 18:42:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 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 256 [2024-09-15 18:42:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:44,965 INFO L225 Difference]: With dead ends: 289 [2024-09-15 18:42:44,966 INFO L226 Difference]: Without dead ends: 287 [2024-09-15 18:42:44,968 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2024-09-15 18:42:44,969 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 304 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:44,969 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 100 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-15 18:42:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-15 18:42:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2024-09-15 18:42:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 268 states have (on average 1.0335820895522387) internal successors, (277), 273 states have internal predecessors, (277), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2024-09-15 18:42:45,004 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2024-09-15 18:42:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:45,005 INFO L474 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2024-09-15 18:42:45,005 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8333333333333335) internal successors, (253), 65 states have internal predecessors, (253), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:45,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2024-09-15 18:42:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-09-15 18:42:45,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:45,006 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:45,006 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 18:42:45,006 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:45,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2024-09-15 18:42:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716475368] [2024-09-15 18:42:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:47,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716475368] [2024-09-15 18:42:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716475368] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:47,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:47,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-09-15 18:42:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377851029] [2024-09-15 18:42:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:47,262 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-15 18:42:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-15 18:42:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-09-15 18:42:47,264 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:49,839 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2024-09-15 18:42:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-09-15 18:42:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 1 states have call successors, (2), 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 257 [2024-09-15 18:42:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:49,842 INFO L225 Difference]: With dead ends: 287 [2024-09-15 18:42:49,842 INFO L226 Difference]: Without dead ends: 285 [2024-09-15 18:42:49,845 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2024-09-15 18:42:49,845 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 327 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:49,845 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 101 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-15 18:42:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-09-15 18:42:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2024-09-15 18:42:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 267 states have (on average 1.0299625468164795) internal successors, (275), 271 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2024-09-15 18:42:49,880 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2024-09-15 18:42:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:49,880 INFO L474 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2024-09-15 18:42:49,881 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:49,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2024-09-15 18:42:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-09-15 18:42:49,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:49,882 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:49,882 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 18:42:49,883 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:49,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2024-09-15 18:42:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:49,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45759765] [2024-09-15 18:42:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:54,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45759765] [2024-09-15 18:42:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45759765] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715172128] [2024-09-15 18:42:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:54,234 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:54,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:54,235 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:54,647 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2024-09-15 18:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:54,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 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 257 [2024-09-15 18:42:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:54,649 INFO L225 Difference]: With dead ends: 275 [2024-09-15 18:42:54,649 INFO L226 Difference]: Without dead ends: 271 [2024-09-15 18:42:54,650 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-15 18:42:54,650 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 295 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:54,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 45 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 18:42:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-09-15 18:42:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-09-15 18:42:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 264 states have (on average 1.0265151515151516) internal successors, (271), 267 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2024-09-15 18:42:54,684 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 257 [2024-09-15 18:42:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:54,684 INFO L474 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2024-09-15 18:42:54,684 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:54,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2024-09-15 18:42:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-09-15 18:42:54,685 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:54,686 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:54,686 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 18:42:54,686 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:54,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1898055296, now seen corresponding path program 1 times [2024-09-15 18:42:54,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:54,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282729343] [2024-09-15 18:42:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:58,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:42:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282729343] [2024-09-15 18:42:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282729343] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963991831] [2024-09-15 18:42:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:58,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:58,962 INFO L87 Difference]: Start difference. First operand 271 states and 274 transitions. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:59,385 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2024-09-15 18:42:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:59,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 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 257 [2024-09-15 18:42:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:59,387 INFO L225 Difference]: With dead ends: 271 [2024-09-15 18:42:59,387 INFO L226 Difference]: Without dead ends: 269 [2024-09-15 18:42:59,387 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:42:59,388 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 270 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:59,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 41 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 18:42:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-09-15 18:42:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-09-15 18:42:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 263 states have (on average 1.0228136882129277) internal successors, (269), 265 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2024-09-15 18:42:59,421 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 257 [2024-09-15 18:42:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:59,422 INFO L474 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2024-09-15 18:42:59,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 7 states have internal predecessors, (254), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:42:59,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2024-09-15 18:42:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-09-15 18:42:59,423 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:59,423 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:59,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-15 18:42:59,424 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:42:59,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash 201570989, now seen corresponding path program 1 times [2024-09-15 18:42:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:59,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225032329] [2024-09-15 18:42:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:04,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:43:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:43:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:43:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225032329] [2024-09-15 18:43:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225032329] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:43:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:43:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:43:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564456669] [2024-09-15 18:43:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:43:04,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:43:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:43:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:43:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:43:04,395 INFO L87 Difference]: Start difference. First operand 269 states and 272 transitions. Second operand has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:43:04,917 INFO L93 Difference]: Finished difference Result 269 states and 272 transitions. [2024-09-15 18:43:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:43:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 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 258 [2024-09-15 18:43:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:43:04,919 INFO L225 Difference]: With dead ends: 269 [2024-09-15 18:43:04,919 INFO L226 Difference]: Without dead ends: 267 [2024-09-15 18:43:04,919 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 18:43:04,920 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 266 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 18:43:04,920 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 37 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 18:43:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-09-15 18:43:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-09-15 18:43:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.0190839694656488) internal successors, (267), 263 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2024-09-15 18:43:04,953 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 258 [2024-09-15 18:43:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:43:04,954 INFO L474 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2024-09-15 18:43:04,954 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:04,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:43:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2024-09-15 18:43:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-09-15 18:43:04,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:43:04,955 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:43:04,955 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-15 18:43:04,955 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:43:04,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:43:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1329807677, now seen corresponding path program 1 times [2024-09-15 18:43:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:43:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620837098] [2024-09-15 18:43:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:43:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:43:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:05,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:43:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:43:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:43:05,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620837098] [2024-09-15 18:43:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620837098] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:43:05,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:43:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:43:05,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195368167] [2024-09-15 18:43:05,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:43:05,183 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:43:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:43:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:43:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:43:05,184 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:43:05,571 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2024-09-15 18:43:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:43:05,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 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 259 [2024-09-15 18:43:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:43:05,573 INFO L225 Difference]: With dead ends: 267 [2024-09-15 18:43:05,573 INFO L226 Difference]: Without dead ends: 265 [2024-09-15 18:43:05,574 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:43:05,575 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 248 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 18:43:05,575 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 42 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 18:43:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-09-15 18:43:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-09-15 18:43:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.0153256704980842) internal successors, (265), 261 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2024-09-15 18:43:05,611 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 259 [2024-09-15 18:43:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:43:05,611 INFO L474 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2024-09-15 18:43:05,612 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:05,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:43:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2024-09-15 18:43:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-15 18:43:05,613 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:43:05,613 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:43:05,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-15 18:43:05,613 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-15 18:43:05,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:43:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1725639877, now seen corresponding path program 1 times [2024-09-15 18:43:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:43:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701390398] [2024-09-15 18:43:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:43:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:43:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:05,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:43:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:43:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 18:43:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:43:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701390398] [2024-09-15 18:43:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701390398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:43:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:43:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:43:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588012959] [2024-09-15 18:43:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:43:05,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:43:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:43:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:43:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:43:05,821 INFO L87 Difference]: Start difference. First operand 265 states and 268 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:43:06,258 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2024-09-15 18:43:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:43:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 1 states have call successors, (2), 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 260 [2024-09-15 18:43:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:43:06,260 INFO L225 Difference]: With dead ends: 265 [2024-09-15 18:43:06,260 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 18:43:06,261 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:43:06,261 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 242 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 18:43:06,262 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 57 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 18:43:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 18:43:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 18:43:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 18:43:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 18:43:06,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-09-15 18:43:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:43:06,265 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 18:43:06,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:43:06,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:43:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 18:43:06,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 18:43:06,268 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-15 18:43:06,268 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-15 18:43:06,268 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-15 18:43:06,269 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-15 18:43:06,270 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-15 18:43:06,273 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-15 18:43:06,275 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:43:06,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 18:43:14,594 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 18:43:14,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 06:43:14 BoogieIcfgContainer [2024-09-15 18:43:14,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 18:43:14,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 18:43:14,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 18:43:14,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 18:43:14,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:42:05" (3/4) ... [2024-09-15 18:43:14,628 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 18:43:14,634 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 18:43:14,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 18:43:14,673 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2024-09-15 18:43:14,676 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-15 18:43:14,679 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-15 18:43:14,681 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 18:43:14,707 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__tmp_148_0 == \old(__tmp_148_0)) && (\old(__tmp_179_1) == __tmp_179_1)) && (\old(__tmp_218_0) == __tmp_218_0)) && (0 <= main__t)) && (__tmp_2390_0 == \old(__tmp_2390_0))) && (\old(__tmp_179_2) == __tmp_179_2)) && (__tmp_109_1 == \old(__tmp_109_1))) && (__tmp_109_0 == \old(__tmp_109_0))) && (\old(__return_2583) == __return_2583)) && (__tmp_2390_1 == \old(__tmp_2390_1))) && (\old(__tmp_179_0) == __tmp_179_0)) [2024-09-15 18:43:14,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 18:43:14,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 18:43:14,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 18:43:14,888 INFO L158 Benchmark]: Toolchain (without parser) took 71924.56ms. Allocated memory was 81.8MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 39.8MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 310.6MB. Max. memory is 16.1GB. [2024-09-15 18:43:14,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 18:43:14,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 915.10ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 39.6MB in the beginning and 51.4MB in the end (delta: -11.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-09-15 18:43:14,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 119.5MB. Free memory was 51.4MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 18:43:14,892 INFO L158 Benchmark]: Boogie Preprocessor took 172.60ms. Allocated memory is still 119.5MB. Free memory was 49.4MB in the beginning and 84.2MB in the end (delta: -34.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-09-15 18:43:14,892 INFO L158 Benchmark]: RCFGBuilder took 1742.63ms. Allocated memory was 119.5MB in the beginning and 165.7MB in the end (delta: 46.1MB). Free memory was 84.2MB in the beginning and 113.6MB in the end (delta: -29.4MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-09-15 18:43:14,892 INFO L158 Benchmark]: TraceAbstraction took 68773.17ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 112.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-09-15 18:43:14,892 INFO L158 Benchmark]: Witness Printer took 261.88ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-09-15 18:43:14,893 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.13ms. Allocated memory is still 50.3MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 915.10ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 39.6MB in the beginning and 51.4MB in the end (delta: -11.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 119.5MB. Free memory was 51.4MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 172.60ms. Allocated memory is still 119.5MB. Free memory was 49.4MB in the beginning and 84.2MB in the end (delta: -34.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1742.63ms. Allocated memory was 119.5MB in the beginning and 165.7MB in the end (delta: 46.1MB). Free memory was 84.2MB in the beginning and 113.6MB in the end (delta: -29.4MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * TraceAbstraction took 68773.17ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 112.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 261.88ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. 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: 41]: 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: 53]: 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: 4678]: 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: 4690]: 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: 4714]: 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: 4726]: 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: 4743]: 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: 4755]: 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: 4783]: 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: 4795]: 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: 4811]: 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: 4823]: 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: 4854]: 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: 4866]: 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: 4893]: 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: 4905]: 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, 479 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5977 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5977 mSDsluCounter, 1490 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17330 IncrementalHoareTripleChecker+Invalid, 17729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 486 mSDtfsCounter, 17330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1337 GetRequests, 636 SyntacticMatches, 5 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10226 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=0, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 38 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 3588 NumberOfCodeBlocks, 3588 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3572 ConstructedInterpolants, 0 QuantifiedInterpolants, 10724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 16 specifications checked. All of them hold - InvariantResult [Line: 264]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) - InvariantResult [Line: 360]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) - InvariantResult [Line: 68]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) - InvariantResult [Line: 4665]: Location Invariant Derived location invariant: ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 335]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) - InvariantResult [Line: 404]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) - InvariantResult [Line: 128]: Location Invariant Derived location invariant: (((((((((((__tmp_148_0 == \old(__tmp_148_0)) && (\old(__tmp_179_1) == __tmp_179_1)) && (\old(__tmp_218_0) == __tmp_218_0)) && (0 <= main__t)) && (__tmp_2390_0 == \old(__tmp_2390_0))) && (\old(__tmp_179_2) == __tmp_179_2)) && (__tmp_109_1 == \old(__tmp_109_1))) && (__tmp_109_0 == \old(__tmp_109_0))) && (\old(__return_2583) == __return_2583)) && (__tmp_2390_1 == \old(__tmp_2390_1))) && (\old(__tmp_179_0) == __tmp_179_0)) - InvariantResult [Line: 4734]: Location Invariant Derived location invariant: ((61 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 5297]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 4770]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (61 <= main__t)) - InvariantResult [Line: 31]: Location Invariant Derived location invariant: ((0 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 475]: Location Invariant Derived location invariant: (0 < ((long long) main__t + 1)) RESULT: Ultimate proved your program to be correct! [2024-09-15 18:43:14,922 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