./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i -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 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:20:43,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:20:43,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:20:43,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:20:43,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:20:43,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:20:43,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:20:43,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:20:43,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:20:43,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:20:43,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:20:43,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:20:43,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:20:43,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:20:43,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:20:43,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:20:43,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:20:43,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:20:43,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:20:43,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:20:43,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:20:43,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:20:43,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:20:43,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:20:43,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:20:43,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:20:43,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:20:43,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:20:43,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:20:43,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:20:43,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:20:43,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:20:43,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:20:43,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:20:43,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:20:43,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:20:43,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:20:43,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:20:43,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:20:43,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:20:43,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:20:43,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:20:43,694 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 -> 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 [2024-11-19 05:20:43,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:20:43,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:20:43,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:20:43,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:20:43,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:20:43,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-19 05:20:45,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:20:46,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:20:46,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-11-19 05:20:46,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ead737cb/0c42fe7bf7b340c78fcab9f8606e14fe/FLAG2246ec582 [2024-11-19 05:20:46,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ead737cb/0c42fe7bf7b340c78fcab9f8606e14fe [2024-11-19 05:20:46,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:20:46,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:20:46,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:20:46,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:20:46,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:20:46,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:46" (1/1) ... [2024-11-19 05:20:46,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c07e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:46, skipping insertion in model container [2024-11-19 05:20:46,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:46" (1/1) ... [2024-11-19 05:20:46,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:20:46,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[33021,33034] [2024-11-19 05:20:46,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44124,44137] [2024-11-19 05:20:46,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44245,44258] [2024-11-19 05:20:46,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:20:46,894 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:20:46,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[33021,33034] [2024-11-19 05:20:47,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44124,44137] [2024-11-19 05:20:47,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44245,44258] [2024-11-19 05:20:47,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:20:47,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:20:47,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47 WrapperNode [2024-11-19 05:20:47,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:20:47,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:20:47,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:20:47,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:20:47,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,260 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-11-19 05:20:47,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:20:47,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:20:47,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:20:47,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:20:47,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,383 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-19 05:20:47,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:20:47,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:20:47,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:20:47,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:20:47,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (1/1) ... [2024-11-19 05:20:47,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:20:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:20:47,543 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-11-19 05:20:47,550 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-11-19 05:20:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:20:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:20:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:20:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:20:47,602 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:20:47,602 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:20:47,602 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:20:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:20:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:20:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:20:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:20:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:20:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:20:47,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:20:47,856 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:20:47,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:20:49,272 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-19 05:20:49,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:20:49,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:20:49,288 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:20:49,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:49 BoogieIcfgContainer [2024-11-19 05:20:49,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:20:49,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:20:49,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:20:49,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:20:49,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:20:46" (1/3) ... [2024-11-19 05:20:49,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bcbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:49, skipping insertion in model container [2024-11-19 05:20:49,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:47" (2/3) ... [2024-11-19 05:20:49,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bcbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:49, skipping insertion in model container [2024-11-19 05:20:49,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:49" (3/3) ... [2024-11-19 05:20:49,295 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-1.i [2024-11-19 05:20:49,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:20:49,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:20:49,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:20:49,375 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;@7c68600d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:20:49,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:20:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 05:20:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:49,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:20:49,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -59717688, now seen corresponding path program 1 times [2024-11-19 05:20:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:49,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440153505] [2024-11-19 05:20:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:20:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440153505] [2024-11-19 05:20:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440153505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:20:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279541814] [2024-11-19 05:20:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:49,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:20:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:49,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:20:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:20:49,872 INFO L87 Difference]: Start difference. First operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-19 05:20:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:49,979 INFO L93 Difference]: Finished difference Result 789 states and 1273 transitions. [2024-11-19 05:20:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:20:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-19 05:20:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:49,998 INFO L225 Difference]: With dead ends: 789 [2024-11-19 05:20:49,998 INFO L226 Difference]: Without dead ends: 391 [2024-11-19 05:20:50,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:20:50,012 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:50,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:20:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-19 05:20:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-19 05:20:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-11-19 05:20:50,084 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 8 [2024-11-19 05:20:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:50,085 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-11-19 05:20:50,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-19 05:20:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-11-19 05:20:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 05:20:50,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:50,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:20:50,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:20:50,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash -690874686, now seen corresponding path program 1 times [2024-11-19 05:20:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236895401] [2024-11-19 05:20:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:20:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236895401] [2024-11-19 05:20:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236895401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:20:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208344435] [2024-11-19 05:20:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:50,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:20:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:20:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:20:50,293 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-19 05:20:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:50,431 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2024-11-19 05:20:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:20:50,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-19 05:20:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:50,436 INFO L225 Difference]: With dead ends: 965 [2024-11-19 05:20:50,437 INFO L226 Difference]: Without dead ends: 775 [2024-11-19 05:20:50,438 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-11-19 05:20:50,439 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 548 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:50,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1715 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-19 05:20:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 393. [2024-11-19 05:20:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2024-11-19 05:20:50,465 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 10 [2024-11-19 05:20:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2024-11-19 05:20:50,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-19 05:20:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2024-11-19 05:20:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:20:50,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:50,469 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:20:50,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:50,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1711501341, now seen corresponding path program 1 times [2024-11-19 05:20:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601435593] [2024-11-19 05:20:50,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:20:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601435593] [2024-11-19 05:20:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601435593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:20:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924287609] [2024-11-19 05:20:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:20:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:20:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:20:50,921 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-19 05:20:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:51,041 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2024-11-19 05:20:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:20:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2024-11-19 05:20:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:51,044 INFO L225 Difference]: With dead ends: 740 [2024-11-19 05:20:51,044 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 05:20:51,044 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-11-19 05:20:51,045 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:51,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 05:20:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-19 05:20:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.4) internal successors, (483), 346 states have internal predecessors, (483), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-19 05:20:51,055 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 86 [2024-11-19 05:20:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:51,055 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-19 05:20:51,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-11-19 05:20:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-19 05:20:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:20:51,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:51,057 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:51,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:20:51,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:51,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782545, now seen corresponding path program 1 times [2024-11-19 05:20:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794596410] [2024-11-19 05:20:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:20:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794596410] [2024-11-19 05:20:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794596410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:20:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052894705] [2024-11-19 05:20:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:20:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:20:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:20:51,268 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-19 05:20:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:51,346 INFO L93 Difference]: Finished difference Result 949 states and 1335 transitions. [2024-11-19 05:20:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:20:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2024-11-19 05:20:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:51,348 INFO L225 Difference]: With dead ends: 949 [2024-11-19 05:20:51,348 INFO L226 Difference]: Without dead ends: 602 [2024-11-19 05:20:51,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:20:51,350 INFO L432 NwaCegarLoop]: 667 mSDtfsCounter, 295 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:51,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-19 05:20:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-19 05:20:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-11-19 05:20:51,362 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 86 [2024-11-19 05:20:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:51,363 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-11-19 05:20:51,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-19 05:20:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-11-19 05:20:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 05:20:51,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:51,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:51,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:20:51,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1837254023, now seen corresponding path program 1 times [2024-11-19 05:20:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95011309] [2024-11-19 05:20:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:20:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95011309] [2024-11-19 05:20:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95011309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:51,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:20:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700007391] [2024-11-19 05:20:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:20:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:20:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:20:51,717 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:51,811 INFO L93 Difference]: Finished difference Result 880 states and 1243 transitions. [2024-11-19 05:20:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:20:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-19 05:20:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:51,816 INFO L225 Difference]: With dead ends: 880 [2024-11-19 05:20:51,817 INFO L226 Difference]: Without dead ends: 876 [2024-11-19 05:20:51,817 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-11-19 05:20:51,820 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 458 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:51,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1380 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-19 05:20:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 600. [2024-11-19 05:20:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 595 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 847 transitions. [2024-11-19 05:20:51,842 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 847 transitions. Word has length 101 [2024-11-19 05:20:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 847 transitions. [2024-11-19 05:20:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 847 transitions. [2024-11-19 05:20:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:20:51,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:51,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:20:51,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 666716360, now seen corresponding path program 1 times [2024-11-19 05:20:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:51,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19442422] [2024-11-19 05:20:51,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:20:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19442422] [2024-11-19 05:20:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19442422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:20:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114142373] [2024-11-19 05:20:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:20:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:20:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:20:52,231 INFO L87 Difference]: Start difference. First operand 600 states and 847 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:52,305 INFO L93 Difference]: Finished difference Result 865 states and 1227 transitions. [2024-11-19 05:20:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:20:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:20:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:52,308 INFO L225 Difference]: With dead ends: 865 [2024-11-19 05:20:52,308 INFO L226 Difference]: Without dead ends: 516 [2024-11-19 05:20:52,309 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-11-19 05:20:52,309 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 30 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:52,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1118 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-19 05:20:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-11-19 05:20:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.3470588235294119) internal successors, (687), 511 states have internal predecessors, (687), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2024-11-19 05:20:52,325 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 155 [2024-11-19 05:20:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:52,326 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2024-11-19 05:20:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-19 05:20:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:20:52,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:52,328 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:52,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:20:52,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:52,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -504797764, now seen corresponding path program 1 times [2024-11-19 05:20:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956171934] [2024-11-19 05:20:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956171934] [2024-11-19 05:20:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956171934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:20:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743627816] [2024-11-19 05:20:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:20:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:20:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:20:52,569 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:52,906 INFO L93 Difference]: Finished difference Result 1288 states and 1731 transitions. [2024-11-19 05:20:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:20:52,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:20:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:52,910 INFO L225 Difference]: With dead ends: 1288 [2024-11-19 05:20:52,910 INFO L226 Difference]: Without dead ends: 863 [2024-11-19 05:20:52,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:20:52,912 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1111 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:52,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1396 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:20:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-19 05:20:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 655. [2024-11-19 05:20:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 649 states have (on average 1.349768875192604) internal successors, (876), 650 states have internal predecessors, (876), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:20:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2024-11-19 05:20:52,967 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 155 [2024-11-19 05:20:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:52,967 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2024-11-19 05:20:52,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2024-11-19 05:20:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:20:52,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:52,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:20:52,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:52,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1095915632, now seen corresponding path program 1 times [2024-11-19 05:20:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232247665] [2024-11-19 05:20:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:53,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232247665] [2024-11-19 05:20:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232247665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:20:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378564357] [2024-11-19 05:20:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:53,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:20:53,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:20:53,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:20:53,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:20:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:54,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 05:20:54,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:20:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:20:54,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 05:20:54,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:20:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:54,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:20:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378564357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:20:54,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:20:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:20:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324753040] [2024-11-19 05:20:54,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:20:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:20:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:20:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:20:54,614 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:20:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:54,879 INFO L93 Difference]: Finished difference Result 2929 states and 3955 transitions. [2024-11-19 05:20:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:20:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2024-11-19 05:20:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:54,889 INFO L225 Difference]: With dead ends: 2929 [2024-11-19 05:20:54,889 INFO L226 Difference]: Without dead ends: 2522 [2024-11-19 05:20:54,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:20:54,891 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 2236 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:54,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 3548 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:20:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-19 05:20:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1002. [2024-11-19 05:20:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 992 states have (on average 1.34375) internal successors, (1333), 993 states have internal predecessors, (1333), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 05:20:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1345 transitions. [2024-11-19 05:20:54,972 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1345 transitions. Word has length 165 [2024-11-19 05:20:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:54,972 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1345 transitions. [2024-11-19 05:20:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:20:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1345 transitions. [2024-11-19 05:20:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:20:54,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:54,977 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:54,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 05:20:55,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:20:55,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash 880262263, now seen corresponding path program 1 times [2024-11-19 05:20:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287480642] [2024-11-19 05:20:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287480642] [2024-11-19 05:20:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287480642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:20:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576622374] [2024-11-19 05:20:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:20:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:20:58,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:20:58,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:20:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:59,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:20:59,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:20:59,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:20:59,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 05:20:59,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:59,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:59,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:59,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:20:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:59,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:21:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:21:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576622374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:21:00,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:21:00,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2024-11-19 05:21:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004822627] [2024-11-19 05:21:00,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:21:00,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 05:21:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 05:21:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-11-19 05:21:00,499 INFO L87 Difference]: Start difference. First operand 1002 states and 1345 transitions. Second operand has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:21:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:01,244 INFO L93 Difference]: Finished difference Result 6217 states and 8404 transitions. [2024-11-19 05:21:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:21:01,246 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 393 [2024-11-19 05:21:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:01,270 INFO L225 Difference]: With dead ends: 6217 [2024-11-19 05:21:01,270 INFO L226 Difference]: Without dead ends: 5810 [2024-11-19 05:21:01,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 778 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:21:01,275 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 7367 mSDsluCounter, 5335 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7377 SdHoareTripleChecker+Valid, 5762 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:01,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7377 Valid, 5762 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:21:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2024-11-19 05:21:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 1866. [2024-11-19 05:21:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1850 states have (on average 1.34) internal successors, (2479), 1851 states have internal predecessors, (2479), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:21:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2503 transitions. [2024-11-19 05:21:01,392 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2503 transitions. Word has length 393 [2024-11-19 05:21:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2503 transitions. [2024-11-19 05:21:01,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:21:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2503 transitions. [2024-11-19 05:21:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:21:01,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:01,412 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:01,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 05:21:01,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 05:21:01,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash -121035259, now seen corresponding path program 2 times [2024-11-19 05:21:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752132096] [2024-11-19 05:21:01,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:21:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:01,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:21:01,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:21:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:21:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752132096] [2024-11-19 05:21:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752132096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:21:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:21:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:21:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459279502] [2024-11-19 05:21:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:21:02,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:21:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:21:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:21:02,204 INFO L87 Difference]: Start difference. First operand 1866 states and 2503 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:02,709 INFO L93 Difference]: Finished difference Result 2303 states and 3093 transitions. [2024-11-19 05:21:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:21:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2024-11-19 05:21:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:02,718 INFO L225 Difference]: With dead ends: 2303 [2024-11-19 05:21:02,718 INFO L226 Difference]: Without dead ends: 1899 [2024-11-19 05:21:02,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:21:02,719 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 20 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:02,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1930 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:21:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-19 05:21:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1878. [2024-11-19 05:21:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1862 states have (on average 1.3378088077336197) internal successors, (2491), 1863 states have internal predecessors, (2491), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:21:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2515 transitions. [2024-11-19 05:21:02,788 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2515 transitions. Word has length 849 [2024-11-19 05:21:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2515 transitions. [2024-11-19 05:21:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2515 transitions. [2024-11-19 05:21:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:21:02,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:02,813 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:21:02,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:02,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1393635768, now seen corresponding path program 1 times [2024-11-19 05:21:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587104967] [2024-11-19 05:21:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:21:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:21:05,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587104967] [2024-11-19 05:21:05,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587104967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:21:05,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:21:05,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:21:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106696889] [2024-11-19 05:21:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:21:05,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:21:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:05,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:21:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:21:05,726 INFO L87 Difference]: Start difference. First operand 1878 states and 2515 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:06,133 INFO L93 Difference]: Finished difference Result 2339 states and 3135 transitions. [2024-11-19 05:21:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:21:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2024-11-19 05:21:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:06,144 INFO L225 Difference]: With dead ends: 2339 [2024-11-19 05:21:06,144 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:21:06,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:21:06,146 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 25 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:06,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1973 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:21:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:21:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1890. [2024-11-19 05:21:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1874 states have (on average 1.3372465314834578) internal successors, (2506), 1875 states have internal predecessors, (2506), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:21:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2530 transitions. [2024-11-19 05:21:06,218 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2530 transitions. Word has length 850 [2024-11-19 05:21:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:06,219 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2530 transitions. [2024-11-19 05:21:06,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2530 transitions. [2024-11-19 05:21:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:21:06,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:06,229 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:21:06,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1960083759, now seen corresponding path program 1 times [2024-11-19 05:21:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783042609] [2024-11-19 05:21:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:21:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:21:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783042609] [2024-11-19 05:21:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783042609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:21:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:21:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:21:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777171128] [2024-11-19 05:21:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:21:08,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:21:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:21:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:21:08,716 INFO L87 Difference]: Start difference. First operand 1890 states and 2530 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:09,123 INFO L93 Difference]: Finished difference Result 2351 states and 3156 transitions. [2024-11-19 05:21:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:21:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:21:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:09,129 INFO L225 Difference]: With dead ends: 2351 [2024-11-19 05:21:09,129 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:21:09,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:21:09,132 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 32 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:09,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2659 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:21:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:21:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1914. [2024-11-19 05:21:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1898 states have (on average 1.3361433087460484) internal successors, (2536), 1899 states have internal predecessors, (2536), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:21:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2560 transitions. [2024-11-19 05:21:09,178 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2560 transitions. Word has length 851 [2024-11-19 05:21:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:09,179 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2560 transitions. [2024-11-19 05:21:09,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2560 transitions. [2024-11-19 05:21:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:21:09,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:09,188 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:09,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:21:09,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:09,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1735359702, now seen corresponding path program 1 times [2024-11-19 05:21:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111044039] [2024-11-19 05:21:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:21:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:21:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111044039] [2024-11-19 05:21:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111044039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:21:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:21:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:21:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780049754] [2024-11-19 05:21:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:21:11,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:21:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:21:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:21:11,646 INFO L87 Difference]: Start difference. First operand 1914 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:12,065 INFO L93 Difference]: Finished difference Result 2393 states and 3198 transitions. [2024-11-19 05:21:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:21:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:21:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:12,074 INFO L225 Difference]: With dead ends: 2393 [2024-11-19 05:21:12,075 INFO L226 Difference]: Without dead ends: 1941 [2024-11-19 05:21:12,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:21:12,077 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 15 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:12,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1658 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:21:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2024-11-19 05:21:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1923. [2024-11-19 05:21:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1907 states have (on average 1.3345568956476141) internal successors, (2545), 1908 states have internal predecessors, (2545), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:21:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2569 transitions. [2024-11-19 05:21:12,156 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2569 transitions. Word has length 851 [2024-11-19 05:21:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2569 transitions. [2024-11-19 05:21:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2569 transitions. [2024-11-19 05:21:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:21:12,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:12,170 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:12,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:21:12,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:12,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1374014853, now seen corresponding path program 1 times [2024-11-19 05:21:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:12,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520631452] [2024-11-19 05:21:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:21:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:21:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520631452] [2024-11-19 05:21:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520631452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:21:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162643508] [2024-11-19 05:21:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:21,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:21:21,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:21:21,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:21:21,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:21:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:21:23,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 4158 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 05:21:23,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:21:23,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:21:23,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 05:21:23,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:23,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:24,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:21:24,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:21:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:21:24,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:21:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:21:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162643508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:21:25,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:21:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 32 [2024-11-19 05:21:25,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623031908] [2024-11-19 05:21:25,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:21:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 05:21:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 05:21:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=582, Unknown=0, NotChecked=0, Total=992 [2024-11-19 05:21:25,194 INFO L87 Difference]: Start difference. First operand 1923 states and 2569 transitions. Second operand has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:21:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:27,049 INFO L93 Difference]: Finished difference Result 14123 states and 18842 transitions. [2024-11-19 05:21:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 05:21:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 852 [2024-11-19 05:21:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:27,083 INFO L225 Difference]: With dead ends: 14123 [2024-11-19 05:21:27,084 INFO L226 Difference]: Without dead ends: 13659 [2024-11-19 05:21:27,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1739 GetRequests, 1688 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 05:21:27,092 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 22280 mSDsluCounter, 10128 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22302 SdHoareTripleChecker+Valid, 10554 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:27,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22302 Valid, 10554 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:21:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2024-11-19 05:21:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 3651. [2024-11-19 05:21:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3623 states have (on average 1.33508142423406) internal successors, (4837), 3624 states have internal predecessors, (4837), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 05:21:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4885 transitions. [2024-11-19 05:21:27,230 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4885 transitions. Word has length 852 [2024-11-19 05:21:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:27,231 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4885 transitions. [2024-11-19 05:21:27,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 05:21:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4885 transitions. [2024-11-19 05:21:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:21:27,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:27,249 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:27,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 05:21:27,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:21:27,450 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:27,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1807879201, now seen corresponding path program 2 times [2024-11-19 05:21:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308028961] [2024-11-19 05:21:27,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:21:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:27,829 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:21:27,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:21:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17562 trivial. 0 not checked. [2024-11-19 05:21:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:21:28,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308028961] [2024-11-19 05:21:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308028961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:21:28,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:21:28,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:21:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73291695] [2024-11-19 05:21:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:21:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:21:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:21:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:21:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:21:28,016 INFO L87 Difference]: Start difference. First operand 3651 states and 4885 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:21:28,318 INFO L93 Difference]: Finished difference Result 4311 states and 5753 transitions. [2024-11-19 05:21:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:21:28,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1764 [2024-11-19 05:21:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:21:28,326 INFO L225 Difference]: With dead ends: 4311 [2024-11-19 05:21:28,327 INFO L226 Difference]: Without dead ends: 3850 [2024-11-19 05:21:28,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:21:28,328 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 436 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:21:28,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1889 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:21:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2024-11-19 05:21:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3686. [2024-11-19 05:21:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3658 states have (on average 1.3329688354291962) internal successors, (4876), 3659 states have internal predecessors, (4876), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 05:21:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4924 transitions. [2024-11-19 05:21:28,406 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4924 transitions. Word has length 1764 [2024-11-19 05:21:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:21:28,407 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4924 transitions. [2024-11-19 05:21:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:21:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4924 transitions. [2024-11-19 05:21:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:21:28,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:21:28,424 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:21:28,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:21:28,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:21:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:21:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1705966899, now seen corresponding path program 1 times [2024-11-19 05:21:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:21:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108421436] [2024-11-19 05:21:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:21:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:21:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat