./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:33:05,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:33:05,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:33:05,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:33:05,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:33:05,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:33:05,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:33:05,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:33:05,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:33:05,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:33:05,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:33:05,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:33:05,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:33:05,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:33:05,994 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:33:05,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:33:05,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:33:05,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:33:05,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:33:05,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:33:05,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:33:05,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:33:05,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:33:05,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:33:05,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:33:05,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:33:06,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:33:06,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:33:06,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:33:06,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:33:06,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:33:06,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:33:06,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:06,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:33:06,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:33:06,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:33:06,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:33:06,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:33:06,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:33:06,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:33:06,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:33:06,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:33:06,004 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 [2024-10-12 18:33:06,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:33:06,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:33:06,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:33:06,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:33:06,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:33:06,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-10-12 18:33:07,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:33:07,993 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:33:07,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-10-12 18:33:08,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb40c5689/882c29aeed19485980f2b991773a22de/FLAG7e7853b7b [2024-10-12 18:33:08,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb40c5689/882c29aeed19485980f2b991773a22de [2024-10-12 18:33:08,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:33:08,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:33:08,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:08,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:33:08,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:33:08,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:08" (1/1) ... [2024-10-12 18:33:08,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a483d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:08, skipping insertion in model container [2024-10-12 18:33:08,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:08" (1/1) ... [2024-10-12 18:33:08,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:33:08,323 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2024-10-12 18:33:08,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2024-10-12 18:33:08,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2024-10-12 18:33:08,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2024-10-12 18:33:08,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2024-10-12 18:33:08,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2024-10-12 18:33:08,732 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2024-10-12 18:33:08,736 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2024-10-12 18:33:08,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2024-10-12 18:33:08,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2024-10-12 18:33:08,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2024-10-12 18:33:08,751 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2024-10-12 18:33:08,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2024-10-12 18:33:08,758 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2024-10-12 18:33:08,762 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2024-10-12 18:33:08,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2024-10-12 18:33:08,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:08,796 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:33:08,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2024-10-12 18:33:08,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2024-10-12 18:33:08,997 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2024-10-12 18:33:09,000 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2024-10-12 18:33:09,004 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2024-10-12 18:33:09,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2024-10-12 18:33:09,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2024-10-12 18:33:09,056 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2024-10-12 18:33:09,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2024-10-12 18:33:09,067 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2024-10-12 18:33:09,070 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2024-10-12 18:33:09,076 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2024-10-12 18:33:09,078 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2024-10-12 18:33:09,085 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2024-10-12 18:33:09,108 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2024-10-12 18:33:09,111 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2024-10-12 18:33:09,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:09,133 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:33:09,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09 WrapperNode [2024-10-12 18:33:09,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:09,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:09,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:33:09,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:33:09,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,251 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3587 [2024-10-12 18:33:09,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:09,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:33:09,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:33:09,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:33:09,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,313 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-12 18:33:09,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:33:09,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:33:09,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:33:09,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:33:09,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (1/1) ... [2024-10-12 18:33:09,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:09,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:33:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:33:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:33:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:33:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:33:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:33:09,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:33:09,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:33:11,206 INFO L? ?]: Removed 1160 outVars from TransFormulas that were not future-live. [2024-10-12 18:33:11,206 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:33:11,264 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:33:11,264 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 18:33:11,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:11 BoogieIcfgContainer [2024-10-12 18:33:11,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:33:11,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:33:11,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:33:11,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:33:11,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:33:08" (1/3) ... [2024-10-12 18:33:11,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7363e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:11, skipping insertion in model container [2024-10-12 18:33:11,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:09" (2/3) ... [2024-10-12 18:33:11,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7363e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:11, skipping insertion in model container [2024-10-12 18:33:11,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:11" (3/3) ... [2024-10-12 18:33:11,272 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2024-10-12 18:33:11,286 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:33:11,286 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-12 18:33:11,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:33:11,363 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=LoopHeads, 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;@5704fd29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:33:11,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-12 18:33:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 473 states, 456 states have (on average 1.9714912280701755) internal successors, (899), 472 states have internal predecessors, (899), 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-12 18:33:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-12 18:33:11,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:11,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-12 18:33:11,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:11,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -662524203, now seen corresponding path program 1 times [2024-10-12 18:33:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:11,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267205591] [2024-10-12 18:33:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:11,648 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-12 18:33:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267205591] [2024-10-12 18:33:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267205591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341414574] [2024-10-12 18:33:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:11,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:11,683 INFO L87 Difference]: Start difference. First operand has 473 states, 456 states have (on average 1.9714912280701755) internal successors, (899), 472 states have internal predecessors, (899), 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 18:33:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:12,741 INFO L93 Difference]: Finished difference Result 476 states and 901 transitions. [2024-10-12 18:33:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2024-10-12 18:33:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:12,758 INFO L225 Difference]: With dead ends: 476 [2024-10-12 18:33:12,758 INFO L226 Difference]: Without dead ends: 296 [2024-10-12 18:33:12,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:12,767 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 703 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:12,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 704 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 18:33:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-12 18:33:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-10-12 18:33:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2775800711743772) internal successors, (359), 295 states have internal predecessors, (359), 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-12 18:33:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2024-10-12 18:33:12,820 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 6 [2024-10-12 18:33:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2024-10-12 18:33:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 18:33:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2024-10-12 18:33:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:33:12,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:12,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:33:12,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 936590238, now seen corresponding path program 1 times [2024-10-12 18:33:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456433853] [2024-10-12 18:33:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:12,985 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-12 18:33:12,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456433853] [2024-10-12 18:33:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456433853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409410042] [2024-10-12 18:33:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:12,989 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-12 18:33:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:13,435 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2024-10-12 18:33:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Word has length 7 [2024-10-12 18:33:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:13,437 INFO L225 Difference]: With dead ends: 296 [2024-10-12 18:33:13,437 INFO L226 Difference]: Without dead ends: 291 [2024-10-12 18:33:13,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:13,438 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 7 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:13,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 754 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:33:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-12 18:33:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-10-12 18:33:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.0613718411552346) internal successors, (294), 290 states have internal predecessors, (294), 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-12 18:33:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2024-10-12 18:33:13,450 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 7 [2024-10-12 18:33:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:13,450 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2024-10-12 18:33:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-12 18:33:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2024-10-12 18:33:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-12 18:33:13,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:13,457 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] [2024-10-12 18:33:13,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:33:13,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:13,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -203403239, now seen corresponding path program 1 times [2024-10-12 18:33:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701991543] [2024-10-12 18:33:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:18,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701991543] [2024-10-12 18:33:18,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701991543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:18,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2024-10-12 18:33:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21772534] [2024-10-12 18:33:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-12 18:33:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-12 18:33:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2024-10-12 18:33:18,125 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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-12 18:33:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:19,001 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2024-10-12 18:33:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-12 18:33:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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) Word has length 243 [2024-10-12 18:33:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:19,005 INFO L225 Difference]: With dead ends: 291 [2024-10-12 18:33:19,006 INFO L226 Difference]: Without dead ends: 289 [2024-10-12 18:33:19,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2024-10-12 18:33:19,008 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 117 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:19,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 128 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 18:33:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-12 18:33:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-10-12 18:33:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 276 states have (on average 1.0579710144927537) internal successors, (292), 288 states have internal predecessors, (292), 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-12 18:33:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2024-10-12 18:33:19,027 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 243 [2024-10-12 18:33:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:19,028 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2024-10-12 18:33:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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-12 18:33:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2024-10-12 18:33:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-12 18:33:19,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:19,038 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] [2024-10-12 18:33:19,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:33:19,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:19,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2010527020, now seen corresponding path program 1 times [2024-10-12 18:33:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924114582] [2024-10-12 18:33:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:19,831 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-12 18:33:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924114582] [2024-10-12 18:33:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924114582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:19,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098882372] [2024-10-12 18:33:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:19,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:19,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:19,834 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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-12 18:33:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:20,297 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2024-10-12 18:33:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:20,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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) Word has length 244 [2024-10-12 18:33:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:20,303 INFO L225 Difference]: With dead ends: 289 [2024-10-12 18:33:20,303 INFO L226 Difference]: Without dead ends: 287 [2024-10-12 18:33:20,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:20,305 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 504 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:20,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 78 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:33:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-12 18:33:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-12 18:33:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.0545454545454545) internal successors, (290), 286 states have internal predecessors, (290), 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-12 18:33:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2024-10-12 18:33:20,324 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 244 [2024-10-12 18:33:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:20,325 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2024-10-12 18:33:20,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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-12 18:33:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2024-10-12 18:33:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 18:33:20,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:20,333 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-12 18:33:20,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:33:20,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2009449187, now seen corresponding path program 1 times [2024-10-12 18:33:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731546181] [2024-10-12 18:33:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:23,947 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-12 18:33:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731546181] [2024-10-12 18:33:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731546181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:23,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2024-10-12 18:33:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109125859] [2024-10-12 18:33:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-12 18:33:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:23,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-12 18:33:23,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2024-10-12 18:33:23,953 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 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-12 18:33:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:24,671 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2024-10-12 18:33:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-12 18:33:24,672 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 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) Word has length 247 [2024-10-12 18:33:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:24,673 INFO L225 Difference]: With dead ends: 290 [2024-10-12 18:33:24,673 INFO L226 Difference]: Without dead ends: 288 [2024-10-12 18:33:24,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 18:33:24,676 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 162 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:24,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 105 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:33:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-12 18:33:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-10-12 18:33:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 274 states have (on average 1.051094890510949) internal successors, (288), 284 states have internal predecessors, (288), 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-12 18:33:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2024-10-12 18:33:24,704 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 247 [2024-10-12 18:33:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2024-10-12 18:33:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 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-12 18:33:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2024-10-12 18:33:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-12 18:33:24,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:24,708 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-12 18:33:24,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:33:24,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2131578528, now seen corresponding path program 1 times [2024-10-12 18:33:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237071627] [2024-10-12 18:33:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:25,338 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-12 18:33:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237071627] [2024-10-12 18:33:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237071627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516588917] [2024-10-12 18:33:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:25,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:25,344 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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-12 18:33:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:25,848 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2024-10-12 18:33:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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) Word has length 248 [2024-10-12 18:33:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:25,851 INFO L225 Difference]: With dead ends: 285 [2024-10-12 18:33:25,851 INFO L226 Difference]: Without dead ends: 283 [2024-10-12 18:33:25,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:25,852 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 352 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:25,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 80 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 18:33:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-12 18:33:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-12 18:33:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 273 states have (on average 1.0476190476190477) internal successors, (286), 282 states have internal predecessors, (286), 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-12 18:33:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 286 transitions. [2024-10-12 18:33:25,858 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 286 transitions. Word has length 248 [2024-10-12 18:33:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:25,858 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 286 transitions. [2024-10-12 18:33:25,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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-12 18:33:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 286 transitions. [2024-10-12 18:33:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-12 18:33:25,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:25,861 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] [2024-10-12 18:33:25,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:33:25,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:25,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash 252627716, now seen corresponding path program 1 times [2024-10-12 18:33:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315186598] [2024-10-12 18:33:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:26,223 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-12 18:33:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315186598] [2024-10-12 18:33:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315186598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:26,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243929026] [2024-10-12 18:33:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:26,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:26,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:26,226 INFO L87 Difference]: Start difference. First operand 283 states and 286 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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-12 18:33:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:26,410 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2024-10-12 18:33:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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) Word has length 250 [2024-10-12 18:33:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:26,412 INFO L225 Difference]: With dead ends: 283 [2024-10-12 18:33:26,412 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 18:33:26,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:26,413 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:26,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 310 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 18:33:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 18:33:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 272 states have (on average 1.0441176470588236) internal successors, (284), 280 states have internal predecessors, (284), 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-12 18:33:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2024-10-12 18:33:26,419 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 250 [2024-10-12 18:33:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2024-10-12 18:33:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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-12 18:33:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2024-10-12 18:33:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-12 18:33:26,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:26,423 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-12 18:33:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:33:26,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash -758469263, now seen corresponding path program 1 times [2024-10-12 18:33:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454767840] [2024-10-12 18:33:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:26,800 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-12 18:33:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454767840] [2024-10-12 18:33:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454767840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455122894] [2024-10-12 18:33:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:26,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:26,804 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-12 18:33:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:27,031 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2024-10-12 18:33:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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) Word has length 251 [2024-10-12 18:33:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:27,033 INFO L225 Difference]: With dead ends: 281 [2024-10-12 18:33:27,033 INFO L226 Difference]: Without dead ends: 277 [2024-10-12 18:33:27,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:27,034 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 5 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:27,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 570 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-12 18:33:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-12 18:33:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 269 states have (on average 1.0408921933085502) internal successors, (280), 276 states have internal predecessors, (280), 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-12 18:33:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2024-10-12 18:33:27,039 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 251 [2024-10-12 18:33:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:27,040 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2024-10-12 18:33:27,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-12 18:33:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2024-10-12 18:33:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-12 18:33:27,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:27,043 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-12 18:33:27,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:33:27,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2020838857, now seen corresponding path program 1 times [2024-10-12 18:33:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:27,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637901296] [2024-10-12 18:33:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,956 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-12 18:33:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637901296] [2024-10-12 18:33:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637901296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2024-10-12 18:33:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056347232] [2024-10-12 18:33:29,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-12 18:33:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-12 18:33:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 18:33:29,961 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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-12 18:33:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:30,665 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2024-10-12 18:33:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-12 18:33:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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) Word has length 252 [2024-10-12 18:33:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:30,667 INFO L225 Difference]: With dead ends: 287 [2024-10-12 18:33:30,668 INFO L226 Difference]: Without dead ends: 285 [2024-10-12 18:33:30,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2024-10-12 18:33:30,669 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 177 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:30,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 88 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:33:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-12 18:33:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2024-10-12 18:33:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.037313432835821) internal successors, (278), 274 states have internal predecessors, (278), 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-12 18:33:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2024-10-12 18:33:30,676 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 252 [2024-10-12 18:33:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:30,677 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2024-10-12 18:33:30,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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-12 18:33:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2024-10-12 18:33:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-12 18:33:30,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:30,679 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-12 18:33:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:33:30,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2022562761, now seen corresponding path program 1 times [2024-10-12 18:33:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971660320] [2024-10-12 18:33:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,357 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-12 18:33:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971660320] [2024-10-12 18:33:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971660320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:33,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:33,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2024-10-12 18:33:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638886381] [2024-10-12 18:33:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:33,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-12 18:33:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:33,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-12 18:33:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 18:33:33,362 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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-12 18:33:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:34,018 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2024-10-12 18:33:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-12 18:33:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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) Word has length 252 [2024-10-12 18:33:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:34,020 INFO L225 Difference]: With dead ends: 285 [2024-10-12 18:33:34,020 INFO L226 Difference]: Without dead ends: 283 [2024-10-12 18:33:34,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2024-10-12 18:33:34,022 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 103 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:34,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 74 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:33:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-12 18:33:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2024-10-12 18:33:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.0337078651685394) internal successors, (276), 272 states have internal predecessors, (276), 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-12 18:33:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 276 transitions. [2024-10-12 18:33:34,028 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 276 transitions. Word has length 252 [2024-10-12 18:33:34,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:34,028 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 276 transitions. [2024-10-12 18:33:34,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 states have internal predecessors, (252), 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-12 18:33:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 276 transitions. [2024-10-12 18:33:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 18:33:34,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:34,030 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] [2024-10-12 18:33:34,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:33:34,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1778511084, now seen corresponding path program 1 times [2024-10-12 18:33:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379971436] [2024-10-12 18:33:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:39,453 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-12 18:33:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379971436] [2024-10-12 18:33:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379971436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:39,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553640643] [2024-10-12 18:33:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:39,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:39,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:39,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:39,455 INFO L87 Difference]: Start difference. First operand 273 states and 276 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-12 18:33:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:39,769 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2024-10-12 18:33:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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) Word has length 253 [2024-10-12 18:33:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:39,771 INFO L225 Difference]: With dead ends: 273 [2024-10-12 18:33:39,771 INFO L226 Difference]: Without dead ends: 269 [2024-10-12 18:33:39,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:39,772 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:39,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 44 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:33:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-12 18:33:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-12 18:33:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.0303030303030303) internal successors, (272), 268 states have internal predecessors, (272), 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-12 18:33:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2024-10-12 18:33:39,777 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 253 [2024-10-12 18:33:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:39,778 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2024-10-12 18:33:39,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-12 18:33:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2024-10-12 18:33:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 18:33:39,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:39,779 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] [2024-10-12 18:33:39,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 18:33:39,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1778961922, now seen corresponding path program 1 times [2024-10-12 18:33:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778736764] [2024-10-12 18:33:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:42,369 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-12 18:33:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778736764] [2024-10-12 18:33:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778736764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:42,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:42,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2024-10-12 18:33:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822230620] [2024-10-12 18:33:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:42,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-12 18:33:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-12 18:33:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 18:33:42,373 INFO L87 Difference]: Start difference. First operand 269 states and 272 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-12 18:33:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:43,112 INFO L93 Difference]: Finished difference Result 279 states and 283 transitions. [2024-10-12 18:33:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-12 18:33:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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) Word has length 253 [2024-10-12 18:33:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:43,114 INFO L225 Difference]: With dead ends: 279 [2024-10-12 18:33:43,114 INFO L226 Difference]: Without dead ends: 277 [2024-10-12 18:33:43,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2024-10-12 18:33:43,116 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 82 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:43,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:33:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-12 18:33:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2024-10-12 18:33:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 263 states have (on average 1.026615969581749) internal successors, (270), 266 states have internal predecessors, (270), 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-12 18:33:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2024-10-12 18:33:43,121 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 253 [2024-10-12 18:33:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2024-10-12 18:33:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 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-12 18:33:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2024-10-12 18:33:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 18:33:43,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:43,124 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] [2024-10-12 18:33:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 18:33:43,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1725070004, now seen corresponding path program 1 times [2024-10-12 18:33:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623912975] [2024-10-12 18:33:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:48,146 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-12 18:33:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623912975] [2024-10-12 18:33:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623912975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20183711] [2024-10-12 18:33:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:48,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:48,148 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-12 18:33:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:48,469 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2024-10-12 18:33:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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) Word has length 253 [2024-10-12 18:33:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:48,471 INFO L225 Difference]: With dead ends: 267 [2024-10-12 18:33:48,471 INFO L226 Difference]: Without dead ends: 265 [2024-10-12 18:33:48,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:48,472 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:48,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:33:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-12 18:33:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-12 18:33:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 262 states have (on average 1.0229007633587786) internal successors, (268), 264 states have internal predecessors, (268), 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-12 18:33:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2024-10-12 18:33:48,476 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 253 [2024-10-12 18:33:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:48,477 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2024-10-12 18:33:48,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-12 18:33:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2024-10-12 18:33:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-12 18:33:48,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:48,478 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-12 18:33:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 18:33:48,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -686749074, now seen corresponding path program 1 times [2024-10-12 18:33:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933530404] [2024-10-12 18:33:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:53,100 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-12 18:33:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933530404] [2024-10-12 18:33:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933530404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:53,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575606441] [2024-10-12 18:33:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:53,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:53,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:53,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:53,103 INFO L87 Difference]: Start difference. First operand 265 states and 268 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-12 18:33:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:53,520 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2024-10-12 18:33:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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) Word has length 254 [2024-10-12 18:33:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:53,522 INFO L225 Difference]: With dead ends: 265 [2024-10-12 18:33:53,522 INFO L226 Difference]: Without dead ends: 263 [2024-10-12 18:33:53,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:53,523 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:53,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:33:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-12 18:33:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-12 18:33:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 261 states have (on average 1.0191570881226053) internal successors, (266), 262 states have internal predecessors, (266), 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-12 18:33:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2024-10-12 18:33:53,528 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 254 [2024-10-12 18:33:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:53,529 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2024-10-12 18:33:53,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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-12 18:33:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2024-10-12 18:33:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-12 18:33:53,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:53,530 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-12 18:33:53,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 18:33:53,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:53,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash -64909193, now seen corresponding path program 1 times [2024-10-12 18:33:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721937582] [2024-10-12 18:33:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:53,829 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-12 18:33:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721937582] [2024-10-12 18:33:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721937582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489022103] [2024-10-12 18:33:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:53,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:53,831 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-12 18:33:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:54,011 INFO L93 Difference]: Finished difference Result 263 states and 266 transitions. [2024-10-12 18:33:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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) Word has length 255 [2024-10-12 18:33:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:54,013 INFO L225 Difference]: With dead ends: 263 [2024-10-12 18:33:54,013 INFO L226 Difference]: Without dead ends: 261 [2024-10-12 18:33:54,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:54,014 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:54,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-12 18:33:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-10-12 18:33:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 260 states have internal predecessors, (264), 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-12 18:33:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2024-10-12 18:33:54,018 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 255 [2024-10-12 18:33:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:54,018 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 264 transitions. [2024-10-12 18:33:54,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-12 18:33:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 264 transitions. [2024-10-12 18:33:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 18:33:54,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:54,020 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-12 18:33:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 18:33:54,020 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-12 18:33:54,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2012178811, now seen corresponding path program 1 times [2024-10-12 18:33:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593612369] [2024-10-12 18:33:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:54,253 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-12 18:33:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593612369] [2024-10-12 18:33:54,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593612369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:54,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320353154] [2024-10-12 18:33:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:54,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:54,257 INFO L87 Difference]: Start difference. First operand 261 states and 264 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-12 18:33:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:54,511 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2024-10-12 18:33:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:54,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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) Word has length 256 [2024-10-12 18:33:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:54,513 INFO L225 Difference]: With dead ends: 261 [2024-10-12 18:33:54,513 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:33:54,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:54,514 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 3 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:54,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 518 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:33:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:33:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:33:54,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-10-12 18:33:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:33:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-12 18:33:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:33:54,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:33:54,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-10-12 18:33:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-10-12 18:33:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-10-12 18:33:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-10-12 18:33:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-10-12 18:33:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-10-12 18:33:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-10-12 18:33:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-10-12 18:33:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-10-12 18:33:54,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-10-12 18:33:54,524 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-10-12 18:33:54,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 18:33:54,527 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:54,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 18:33:54,535 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:33:54,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:33:54 BoogieIcfgContainer [2024-10-12 18:33:54,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:33:54,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:33:54,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:33:54,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:33:54,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:11" (3/4) ... [2024-10-12 18:33:54,548 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 18:33:54,585 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-12 18:33:54,588 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 18:33:54,592 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 18:33:54,595 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 18:33:54,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:33:54,870 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 18:33:54,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:33:54,870 INFO L158 Benchmark]: Toolchain (without parser) took 46833.34ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 118.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-12 18:33:54,871 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:33:54,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1095.39ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 102.2MB in the end (delta: 16.1MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.09ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 89.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,872 INFO L158 Benchmark]: Boogie Preprocessor took 166.80ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 77.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,873 INFO L158 Benchmark]: RCFGBuilder took 1844.26ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 77.1MB in the beginning and 115.9MB in the end (delta: -38.9MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,873 INFO L158 Benchmark]: TraceAbstraction took 43278.86ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 114.9MB in the beginning and 671.9MB in the end (delta: -557.1MB). Peak memory consumption was 988.5MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,873 INFO L158 Benchmark]: Witness Printer took 324.14ms. Allocated memory is still 1.8GB. Free memory was 671.9MB in the beginning and 1.7GB in the end (delta: -1.0GB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 18:33:54,875 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.15ms. Allocated memory is still 113.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1095.39ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 102.2MB in the end (delta: 16.1MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.09ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 89.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 166.80ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 77.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1844.26ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 77.1MB in the beginning and 115.9MB in the end (delta: -38.9MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43278.86ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 114.9MB in the beginning and 671.9MB in the end (delta: -557.1MB). Peak memory consumption was 988.5MB. Max. memory is 16.1GB. * Witness Printer took 324.14ms. Allocated memory is still 1.8GB. Free memory was 671.9MB in the beginning and 1.7GB in the end (delta: -1.0GB). Peak memory consumption was 16.8MB. 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 1 procedures, 473 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2349 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2349 mSDsluCounter, 3856 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2136 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14139 IncrementalHoareTripleChecker+Invalid, 14742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 1720 mSDtfsCounter, 14139 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 386 SyntacticMatches, 3 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=0, InterpolantAutomatonStates: 371, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 3524 NumberOfCodeBlocks, 3524 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3508 ConstructedInterpolants, 0 QuantifiedInterpolants, 8972 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 RESULT: Ultimate proved your program to be correct! [2024-10-12 18:33:54,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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