./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:16:58,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:16:58,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:16:58,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:16:58,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:16:58,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:16:58,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:16:58,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:16:58,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:16:58,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:16:58,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:16:58,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:16:58,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:16:58,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:16:58,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:16:58,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:16:58,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:16:58,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:16:58,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:16:58,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:16:58,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:16:58,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:16:58,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:16:58,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:16:58,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:16:58,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:16:58,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:16:58,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:16:58,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:16:58,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:16:58,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:16:58,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:16:58,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:58,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:16:58,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:16:58,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:16:58,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:16:58,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:16:58,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:16:58,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:16:58,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:16:58,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:16:58,711 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:16:58,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:16:58,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:16:58,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:16:58,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:16:58,980 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:16:58,981 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-10-15 14:17:00,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:17:00,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:17:00,680 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-10-15 14:17:00,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/129d0b638/d0bb189baead4798a75196a4a6472918/FLAGb4c56bf0d [2024-10-15 14:17:00,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/129d0b638/d0bb189baead4798a75196a4a6472918 [2024-10-15 14:17:00,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:17:00,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:17:00,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:00,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:17:00,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:17:00,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:00" (1/1) ... [2024-10-15 14:17:00,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb74843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:00, skipping insertion in model container [2024-10-15 14:17:00,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:00" (1/1) ... [2024-10-15 14:17:01,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:17:01,328 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-10-15 14:17:01,334 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-10-15 14:17:01,713 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-10-15 14:17:01,720 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-10-15 14:17:01,724 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-10-15 14:17:01,728 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-10-15 14:17:01,732 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-10-15 14:17:01,736 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-10-15 14:17:01,741 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-10-15 14:17:01,744 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-10-15 14:17:01,748 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-10-15 14:17:01,753 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-10-15 14:17:01,757 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-10-15 14:17:01,760 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-10-15 14:17:01,764 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-10-15 14:17:01,767 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-10-15 14:17:01,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:01,806 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:17:01,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[1000,1013] [2024-10-15 14:17:01,820 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-10-15 14:17:02,049 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-10-15 14:17:02,053 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2024-10-15 14:17:02,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2024-10-15 14:17:02,061 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-10-15 14:17:02,064 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-10-15 14:17:02,068 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-10-15 14:17:02,072 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2024-10-15 14:17:02,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2024-10-15 14:17:02,080 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-10-15 14:17:02,083 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-10-15 14:17:02,087 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-10-15 14:17:02,090 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-10-15 14:17:02,094 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-10-15 14:17:02,097 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-10-15 14:17:02,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:02,123 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:17:02,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02 WrapperNode [2024-10-15 14:17:02,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:02,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:02,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:17:02,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:17:02,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,172 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:17:02,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:02,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:17:02,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:17:02,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:17:02,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,261 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-10-15 14:17:02,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:17:02,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:17:02,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:17:02,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:17:02,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:02,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:02,406 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-10-15 14:17:02,410 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-10-15 14:17:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:17:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:17:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:17:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:17:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:17:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:17:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:17:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:17:02,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:17:02,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:17:04,221 INFO L? ?]: Removed 1159 outVars from TransFormulas that were not future-live. [2024-10-15 14:17:04,221 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:17:04,264 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:17:04,264 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 14:17:04,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:04 BoogieIcfgContainer [2024-10-15 14:17:04,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:17:04,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:17:04,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:17:04,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:17:04,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:17:00" (1/3) ... [2024-10-15 14:17:04,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456bf9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:04, skipping insertion in model container [2024-10-15 14:17:04,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (2/3) ... [2024-10-15 14:17:04,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456bf9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:04, skipping insertion in model container [2024-10-15 14:17:04,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:04" (3/3) ... [2024-10-15 14:17:04,273 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2024-10-15 14:17:04,290 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:17:04,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-15 14:17:04,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:17:04,374 INFO L333 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;@76dc754d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:17:04,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-15 14:17:04,382 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-10-15 14:17:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-15 14:17:04,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:04,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:04,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:04,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2024-10-15 14:17:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419081139] [2024-10-15 14:17:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419081139] [2024-10-15 14:17:04,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419081139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450945946] [2024-10-15 14:17:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:04,860 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-10-15 14:17:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,854 INFO L93 Difference]: Finished difference Result 495 states and 922 transitions. [2024-10-15 14:17:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:06,857 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-10-15 14:17:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,867 INFO L225 Difference]: With dead ends: 495 [2024-10-15 14:17:06,868 INFO L226 Difference]: Without dead ends: 305 [2024-10-15 14:17:06,872 INFO L431 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-10-15 14:17:06,876 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1402 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:06,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 191 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-15 14:17:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-15 14:17:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2024-10-15 14:17:06,986 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-10-15 14:17:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2024-10-15 14:17:06,989 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2024-10-15 14:17:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,990 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2024-10-15 14:17:06,990 INFO L472 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-10-15 14:17:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2024-10-15 14:17:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:17:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:17:06,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2024-10-15 14:17:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701856576] [2024-10-15 14:17:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701856576] [2024-10-15 14:17:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701856576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:07,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033373041] [2024-10-15 14:17:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:07,178 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-10-15 14:17:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,081 INFO L93 Difference]: Finished difference Result 303 states and 366 transitions. [2024-10-15 14:17:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:08,082 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-10-15 14:17:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,084 INFO L225 Difference]: With dead ends: 303 [2024-10-15 14:17:08,084 INFO L226 Difference]: Without dead ends: 295 [2024-10-15 14:17:08,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:08,086 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 315 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:08,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 145 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-15 14:17:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-15 14:17:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-15 14:17:08,141 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-10-15 14:17:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2024-10-15 14:17:08,143 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2024-10-15 14:17:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,143 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2024-10-15 14:17:08,143 INFO L472 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-10-15 14:17:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2024-10-15 14:17:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-15 14:17:08,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,156 INFO L215 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-10-15 14:17:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:17:08,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2024-10-15 14:17:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716313087] [2024-10-15 14:17:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716313087] [2024-10-15 14:17:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716313087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:12,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:12,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2024-10-15 14:17:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558715306] [2024-10-15 14:17:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:12,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-15 14:17:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:12,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-15 14:17:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2024-10-15 14:17:12,725 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-10-15 14:17:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:16,077 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2024-10-15 14:17:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-15 14:17:16,077 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-10-15 14:17:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:16,081 INFO L225 Difference]: With dead ends: 295 [2024-10-15 14:17:16,081 INFO L226 Difference]: Without dead ends: 293 [2024-10-15 14:17:16,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2024-10-15 14:17:16,088 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 395 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:16,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 148 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-15 14:17:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-15 14:17:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-10-15 14:17:16,150 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-10-15 14:17:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2024-10-15 14:17:16,152 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2024-10-15 14:17:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:16,156 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2024-10-15 14:17:16,156 INFO L472 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-10-15 14:17:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2024-10-15 14:17:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-15 14:17:16,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:16,163 INFO L215 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-10-15 14:17:16,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:17:16,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:16,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2024-10-15 14:17:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79278542] [2024-10-15 14:17:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79278542] [2024-10-15 14:17:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79278542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:22,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:17:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62604336] [2024-10-15 14:17:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:17:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:17:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:22,961 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-10-15 14:17:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:23,513 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2024-10-15 14:17:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:23,514 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-10-15 14:17:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:23,516 INFO L225 Difference]: With dead ends: 293 [2024-10-15 14:17:23,517 INFO L226 Difference]: Without dead ends: 291 [2024-10-15 14:17:23,517 INFO L431 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-10-15 14:17:23,518 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-10-15 14:17:23,519 INFO L433 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-10-15 14:17:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-15 14:17:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-10-15 14:17:23,564 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-10-15 14:17:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2024-10-15 14:17:23,566 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2024-10-15 14:17:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:23,566 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2024-10-15 14:17:23,567 INFO L472 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-10-15 14:17:23,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2024-10-15 14:17:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-15 14:17:23,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:23,570 INFO L215 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-10-15 14:17:23,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:17:23,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:23,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2024-10-15 14:17:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:23,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199773449] [2024-10-15 14:17:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199773449] [2024-10-15 14:17:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199773449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:26,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2024-10-15 14:17:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139251510] [2024-10-15 14:17:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:26,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-15 14:17:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-15 14:17:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1897, Invalid=2263, Unknown=0, NotChecked=0, Total=4160 [2024-10-15 14:17:26,747 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-10-15 14:17:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:29,700 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2024-10-15 14:17:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-15 14:17:29,700 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-10-15 14:17:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:29,702 INFO L225 Difference]: With dead ends: 294 [2024-10-15 14:17:29,702 INFO L226 Difference]: Without dead ends: 292 [2024-10-15 14:17:29,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2007 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5622, Invalid=10128, Unknown=0, NotChecked=0, Total=15750 [2024-10-15 14:17:29,706 INFO L432 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-10-15 14:17:29,707 INFO L433 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-10-15 14:17:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-15 14:17:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-10-15 14:17:29,748 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-10-15 14:17:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2024-10-15 14:17:29,750 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2024-10-15 14:17:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:29,751 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2024-10-15 14:17:29,751 INFO L472 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-10-15 14:17:29,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2024-10-15 14:17:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-15 14:17:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:29,755 INFO L215 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-10-15 14:17:29,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:17:29,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:29,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2024-10-15 14:17:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694235480] [2024-10-15 14:17:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694235480] [2024-10-15 14:17:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694235480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:35,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:35,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:17:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020169337] [2024-10-15 14:17:35,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:35,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:17:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:17:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:35,747 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-10-15 14:17:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:36,289 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2024-10-15 14:17:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:36,290 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-10-15 14:17:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:36,291 INFO L225 Difference]: With dead ends: 289 [2024-10-15 14:17:36,292 INFO L226 Difference]: Without dead ends: 287 [2024-10-15 14:17:36,292 INFO L431 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-10-15 14:17:36,293 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 325 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-10-15 14:17:36,293 INFO L433 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-10-15 14:17:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-15 14:17:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-15 14:17:36,331 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-10-15 14:17:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2024-10-15 14:17:36,333 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2024-10-15 14:17:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2024-10-15 14:17:36,334 INFO L472 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-10-15 14:17:36,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2024-10-15 14:17:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-15 14:17:36,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:36,337 INFO L215 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-10-15 14:17:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:17:36,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2024-10-15 14:17:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286249806] [2024-10-15 14:17:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286249806] [2024-10-15 14:17:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286249806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265738373] [2024-10-15 14:17:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:36,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:36,646 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-10-15 14:17:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:37,137 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2024-10-15 14:17:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:37,137 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-10-15 14:17:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:37,141 INFO L225 Difference]: With dead ends: 287 [2024-10-15 14:17:37,141 INFO L226 Difference]: Without dead ends: 285 [2024-10-15 14:17:37,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:37,145 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:37,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 80 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:17:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-15 14:17:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-15 14:17:37,201 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-10-15 14:17:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2024-10-15 14:17:37,207 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2024-10-15 14:17:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2024-10-15 14:17:37,208 INFO L472 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-10-15 14:17:37,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2024-10-15 14:17:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-15 14:17:37,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:37,212 INFO L215 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-10-15 14:17:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:17:37,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2024-10-15 14:17:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334858933] [2024-10-15 14:17:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334858933] [2024-10-15 14:17:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334858933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395144482] [2024-10-15 14:17:37,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:37,488 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-10-15 14:17:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:37,975 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2024-10-15 14:17:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:37,976 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-10-15 14:17:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:37,978 INFO L225 Difference]: With dead ends: 285 [2024-10-15 14:17:37,978 INFO L226 Difference]: Without dead ends: 281 [2024-10-15 14:17:37,979 INFO L431 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-10-15 14:17:37,979 INFO L432 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-10-15 14:17:37,980 INFO L433 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-10-15 14:17:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-15 14:17:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-15 14:17:38,025 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-10-15 14:17:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2024-10-15 14:17:38,027 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2024-10-15 14:17:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:38,027 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2024-10-15 14:17:38,027 INFO L472 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-10-15 14:17:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2024-10-15 14:17:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-15 14:17:38,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:38,029 INFO L215 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-10-15 14:17:38,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:17:38,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:38,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2024-10-15 14:17:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:38,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837483623] [2024-10-15 14:17:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837483623] [2024-10-15 14:17:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837483623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-10-15 14:17:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893478867] [2024-10-15 14:17:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-15 14:17:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-15 14:17:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-10-15 14:17:40,500 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-10-15 14:17:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:43,317 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2024-10-15 14:17:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-15 14:17:43,318 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-10-15 14:17:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:43,320 INFO L225 Difference]: With dead ends: 291 [2024-10-15 14:17:43,320 INFO L226 Difference]: Without dead ends: 289 [2024-10-15 14:17:43,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2024-10-15 14:17:43,324 INFO L432 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-10-15 14:17:43,324 INFO L433 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-10-15 14:17:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-15 14:17:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2024-10-15 14:17:43,366 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-10-15 14:17:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2024-10-15 14:17:43,367 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2024-10-15 14:17:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:43,367 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2024-10-15 14:17:43,367 INFO L472 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-10-15 14:17:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2024-10-15 14:17:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-15 14:17:43,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:43,369 INFO L215 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-10-15 14:17:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:17:43,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2024-10-15 14:17:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637842441] [2024-10-15 14:17:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637842441] [2024-10-15 14:17:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637842441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-10-15 14:17:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67378734] [2024-10-15 14:17:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-15 14:17:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-15 14:17:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-10-15 14:17:45,753 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-10-15 14:17:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:48,517 INFO L93 Difference]: Finished difference Result 289 states and 293 transitions. [2024-10-15 14:17:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-15 14:17:48,518 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-10-15 14:17:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:48,520 INFO L225 Difference]: With dead ends: 289 [2024-10-15 14:17:48,520 INFO L226 Difference]: Without dead ends: 287 [2024-10-15 14:17:48,521 INFO L431 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-10-15 14:17:48,522 INFO L432 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-10-15 14:17:48,522 INFO L433 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-10-15 14:17:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-15 14:17:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2024-10-15 14:17:48,558 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-10-15 14:17:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2024-10-15 14:17:48,559 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2024-10-15 14:17:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:48,559 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2024-10-15 14:17:48,560 INFO L472 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-10-15 14:17:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2024-10-15 14:17:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-15 14:17:48,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:48,562 INFO L215 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-10-15 14:17:48,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-15 14:17:48,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:48,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2024-10-15 14:17:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548846030] [2024-10-15 14:17:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548846030] [2024-10-15 14:17:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548846030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2024-10-15 14:17:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605257951] [2024-10-15 14:17:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:51,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-15 14:17:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-15 14:17:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2024-10-15 14:17:51,182 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-10-15 14:17:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:53,882 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2024-10-15 14:17:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-15 14:17:53,882 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-10-15 14:17:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:53,885 INFO L225 Difference]: With dead ends: 287 [2024-10-15 14:17:53,885 INFO L226 Difference]: Without dead ends: 285 [2024-10-15 14:17:53,888 INFO L431 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-10-15 14:17:53,889 INFO L432 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-10-15 14:17:53,889 INFO L433 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-10-15 14:17:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-15 14:17:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2024-10-15 14:17:53,931 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-10-15 14:17:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2024-10-15 14:17:53,933 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2024-10-15 14:17:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:53,933 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2024-10-15 14:17:53,934 INFO L472 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-10-15 14:17:53,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2024-10-15 14:17:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-15 14:17:53,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:53,936 INFO L215 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-10-15 14:17:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-15 14:17:53,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2024-10-15 14:17:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070488540] [2024-10-15 14:17:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070488540] [2024-10-15 14:17:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070488540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:17:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438921198] [2024-10-15 14:17:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:58,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:17:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:17:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:58,370 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-10-15 14:17:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:58,788 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2024-10-15 14:17:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:58,788 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-10-15 14:17:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:58,790 INFO L225 Difference]: With dead ends: 275 [2024-10-15 14:17:58,790 INFO L226 Difference]: Without dead ends: 271 [2024-10-15 14:17:58,790 INFO L431 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-10-15 14:17:58,791 INFO L432 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-10-15 14:17:58,791 INFO L433 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-10-15 14:17:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-15 14:17:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-10-15 14:17:58,828 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-10-15 14:17:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2024-10-15 14:17:58,829 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 257 [2024-10-15 14:17:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2024-10-15 14:17:58,830 INFO L472 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-10-15 14:17:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2024-10-15 14:17:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-15 14:17:58,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:58,832 INFO L215 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-10-15 14:17:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:17:58,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:17:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1898055296, now seen corresponding path program 1 times [2024-10-15 14:17:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:58,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078228032] [2024-10-15 14:17:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:03,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078228032] [2024-10-15 14:18:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078228032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:03,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:18:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363096847] [2024-10-15 14:18:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:03,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:18:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:18:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:18:03,476 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-10-15 14:18:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:03,911 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2024-10-15 14:18:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:18:03,911 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-10-15 14:18:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:03,913 INFO L225 Difference]: With dead ends: 271 [2024-10-15 14:18:03,913 INFO L226 Difference]: Without dead ends: 269 [2024-10-15 14:18:03,914 INFO L431 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-10-15 14:18:03,914 INFO L432 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-10-15 14:18:03,914 INFO L433 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-10-15 14:18:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-15 14:18:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-15 14:18:03,964 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-10-15 14:18:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2024-10-15 14:18:03,965 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 257 [2024-10-15 14:18:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:03,966 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2024-10-15 14:18:03,966 INFO L472 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-10-15 14:18:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2024-10-15 14:18:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-15 14:18:03,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:03,968 INFO L215 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-10-15 14:18:03,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-15 14:18:03,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:18:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 201570989, now seen corresponding path program 1 times [2024-10-15 14:18:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348870828] [2024-10-15 14:18:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348870828] [2024-10-15 14:18:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348870828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:18:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288458641] [2024-10-15 14:18:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:18:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:18:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:18:08,534 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-10-15 14:18:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:08,962 INFO L93 Difference]: Finished difference Result 269 states and 272 transitions. [2024-10-15 14:18:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:18:08,963 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-10-15 14:18:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:08,964 INFO L225 Difference]: With dead ends: 269 [2024-10-15 14:18:08,965 INFO L226 Difference]: Without dead ends: 267 [2024-10-15 14:18:08,965 INFO L431 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-10-15 14:18:08,965 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:08,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 37 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-15 14:18:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-15 14:18:09,000 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-10-15 14:18:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2024-10-15 14:18:09,002 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 258 [2024-10-15 14:18:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:09,002 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2024-10-15 14:18:09,003 INFO L472 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-10-15 14:18:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2024-10-15 14:18:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-15 14:18:09,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:09,005 INFO L215 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-10-15 14:18:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-15 14:18:09,005 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:18:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1329807677, now seen corresponding path program 1 times [2024-10-15 14:18:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213975880] [2024-10-15 14:18:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213975880] [2024-10-15 14:18:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213975880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:09,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:09,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:18:09,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222462620] [2024-10-15 14:18:09,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:18:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:09,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:18:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:18:09,245 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-10-15 14:18:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:09,623 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2024-10-15 14:18:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:18:09,623 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-10-15 14:18:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:09,626 INFO L225 Difference]: With dead ends: 267 [2024-10-15 14:18:09,626 INFO L226 Difference]: Without dead ends: 265 [2024-10-15 14:18:09,626 INFO L431 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-10-15 14:18:09,627 INFO L432 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-10-15 14:18:09,627 INFO L433 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-10-15 14:18:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-15 14:18:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-15 14:18:09,681 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-10-15 14:18:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2024-10-15 14:18:09,683 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 259 [2024-10-15 14:18:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2024-10-15 14:18:09,684 INFO L472 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-10-15 14:18:09,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2024-10-15 14:18:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-15 14:18:09,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:09,686 INFO L215 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-10-15 14:18:09,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-15 14:18:09,686 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-10-15 14:18:09,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1725639877, now seen corresponding path program 1 times [2024-10-15 14:18:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925083588] [2024-10-15 14:18:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925083588] [2024-10-15 14:18:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925083588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:09,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:18:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880828241] [2024-10-15 14:18:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:09,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:18:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:18:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:18:09,890 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-10-15 14:18:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:10,330 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2024-10-15 14:18:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:18:10,331 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-10-15 14:18:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:10,332 INFO L225 Difference]: With dead ends: 265 [2024-10-15 14:18:10,332 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:18:10,333 INFO L431 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-10-15 14:18:10,334 INFO L432 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-10-15 14:18:10,334 INFO L433 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-10-15 14:18:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:18:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:18:10,335 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-10-15 14:18:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:18:10,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-10-15 14:18:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:10,336 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:18:10,336 INFO L472 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-10-15 14:18:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:18:10,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:18:10,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-10-15 14:18:10,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-10-15 14:18:10,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-10-15 14:18:10,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-10-15 14:18:10,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-10-15 14:18:10,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-10-15 14:18:10,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-10-15 14:18:10,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-10-15 14:18:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-15 14:18:10,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:10,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:18:19,539 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:18:19,567 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~__tmp_148_0~0 |old(~__tmp_148_0~0)|) (= |old(~__tmp_179_1~0)| ~__tmp_179_1~0) (= |old(~__tmp_218_0~0)| ~__tmp_218_0~0) (= ~__tmp_2390_0~0 |old(~__tmp_2390_0~0)|) (= |old(~__tmp_179_2~0)| ~__tmp_179_2~0) (= ~__tmp_109_1~0 |old(~__tmp_109_1~0)|) (= ~__tmp_109_0~0 |old(~__tmp_109_0~0)|) (= |old(~__return_2583~0)| ~__return_2583~0) (= ~__tmp_2390_1~0 |old(~__tmp_2390_1~0)|) (= |old(~__tmp_179_0~0)| ~__tmp_179_0~0)) Eliminated clause: true [2024-10-15 14:18:19,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:18:19 BoogieIcfgContainer [2024-10-15 14:18:19,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:18:19,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:18:19,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:18:19,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:18:19,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:04" (3/4) ... [2024-10-15 14:18:19,574 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:18:19,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:18:19,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:18:19,651 INFO L158 Benchmark]: Toolchain (without parser) took 78674.18ms. Allocated memory was 148.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 83.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 405.8MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,652 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 100.7MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:18:19,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1145.66ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 83.0MB in the beginning and 132.1MB in the end (delta: -49.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.79ms. Allocated memory is still 195.0MB. Free memory was 132.1MB in the beginning and 131.1MB in the end (delta: 968.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,653 INFO L158 Benchmark]: Boogie Preprocessor took 190.23ms. Allocated memory is still 195.0MB. Free memory was 130.1MB in the beginning and 118.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,653 INFO L158 Benchmark]: RCFGBuilder took 1896.42ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 118.5MB in the beginning and 186.0MB in the end (delta: -67.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,653 INFO L158 Benchmark]: TraceAbstraction took 75304.60ms. Allocated memory was 264.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 185.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 971.3MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,653 INFO L158 Benchmark]: Witness Printer took 79.03ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:18:19,657 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.85ms. Allocated memory is still 100.7MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1145.66ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 83.0MB in the beginning and 132.1MB in the end (delta: -49.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.79ms. Allocated memory is still 195.0MB. Free memory was 132.1MB in the beginning and 131.1MB in the end (delta: 968.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.23ms. Allocated memory is still 195.0MB. Free memory was 130.1MB in the beginning and 118.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1896.42ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 118.5MB in the beginning and 186.0MB in the end (delta: -67.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 75304.60ms. Allocated memory was 264.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 185.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 971.3MB. Max. memory is 16.1GB. * Witness Printer took 79.03ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 66.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5977 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5977 mSDsluCounter, 1490 SdHoareTripleChecker+Invalid, 7.7s 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, 18.4s 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.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 38 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 41.5s 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)) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:18:19,694 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