./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.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_SFH_test9-2.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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:25:01,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:25:01,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:25:01,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:25:01,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:25:01,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:25:01,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:25:01,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:25:01,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:25:01,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:25:01,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:25:01,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:25:01,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:25:01,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:25:01,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:25:01,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:25:01,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:25:01,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:25:01,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:25:01,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:25:01,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:25:01,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:25:01,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:25:01,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:25:01,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:25:01,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:25:01,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:25:01,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:25:01,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:25:01,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:25:01,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:25:01,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:25:01,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:25:01,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:25:01,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:25:01,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:25:01,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:25:01,953 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-11-19 05:25:02,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:25:02,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:25:02,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:25:02,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:25:02,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:25:02,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-19 05:25:03,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:25:03,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:25:03,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-19 05:25:03,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a8fe270/ac7b2d66c9bd4f1c9e531cce4a282ecd/FLAGf61d5f584 [2024-11-19 05:25:03,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a8fe270/ac7b2d66c9bd4f1c9e531cce4a282ecd [2024-11-19 05:25:03,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:25:03,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:25:03,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:25:03,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:25:03,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:25:03,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:25:03" (1/1) ... [2024-11-19 05:25:03,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c217ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:03, skipping insertion in model container [2024-11-19 05:25:03,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:25:03" (1/1) ... [2024-11-19 05:25:03,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:25:04,102 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_SFH_test9-2.i[33021,33034] [2024-11-19 05:25:04,314 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_SFH_test9-2.i[84583,84596] [2024-11-19 05:25:04,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:25:04,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:25:04,361 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_SFH_test9-2.i[33021,33034] [2024-11-19 05:25:04,446 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_SFH_test9-2.i[84583,84596] [2024-11-19 05:25:04,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:25:04,493 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:25:04,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04 WrapperNode [2024-11-19 05:25:04,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:25:04,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:25:04,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:25:04,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:25:04,500 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:25:04" (1/1) ... [2024-11-19 05:25:04,534 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:25:04" (1/1) ... [2024-11-19 05:25:04,614 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3448 [2024-11-19 05:25:04,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:25:04,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:25:04,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:25:04,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:25:04,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,704 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 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, 4, 50]. [2024-11-19 05:25:04,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:25:04,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:25:04,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:25:04,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:25:04,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (1/1) ... [2024-11-19 05:25:04,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:25:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:25:04,838 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:25:04,844 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:25:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:25:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:25:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:25:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 05:25:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:25:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:25:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:25:04,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:25:04,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:25:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:25:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:25:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:25:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:25:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:25:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:25:05,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:25:05,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:25:06,994 INFO L? ?]: Removed 824 outVars from TransFormulas that were not future-live. [2024-11-19 05:25:06,994 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:25:07,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:25:07,024 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:25:07,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:25:07 BoogieIcfgContainer [2024-11-19 05:25:07,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:25:07,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:25:07,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:25:07,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:25:07,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:25:03" (1/3) ... [2024-11-19 05:25:07,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e1ac02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:25:07, skipping insertion in model container [2024-11-19 05:25:07,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:04" (2/3) ... [2024-11-19 05:25:07,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e1ac02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:25:07, skipping insertion in model container [2024-11-19 05:25:07,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:25:07" (3/3) ... [2024-11-19 05:25:07,032 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-2.i [2024-11-19 05:25:07,046 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:25:07,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:25:07,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:25:07,130 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;@2e46a06d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:25:07,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:25:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 05:25:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 05:25:07,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:07,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:25:07,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:07,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1749759959, now seen corresponding path program 1 times [2024-11-19 05:25:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167293290] [2024-11-19 05:25:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:07,290 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:25:07,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:07,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167293290] [2024-11-19 05:25:07,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167293290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:07,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:25:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837763970] [2024-11-19 05:25:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:07,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:25:07,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:25:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:25:07,334 INFO L87 Difference]: Start difference. First operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:25:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:07,502 INFO L93 Difference]: Finished difference Result 2810 states and 5798 transitions. [2024-11-19 05:25:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:25:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-19 05:25:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:07,541 INFO L225 Difference]: With dead ends: 2810 [2024-11-19 05:25:07,541 INFO L226 Difference]: Without dead ends: 1367 [2024-11-19 05:25:07,557 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:25:07,561 INFO L432 NwaCegarLoop]: 2581 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, 2581 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:25:07,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:25:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-19 05:25:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-11-19 05:25:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 860 states have (on average 1.7709302325581395) internal successors, (1523), 1361 states have internal predecessors, (1523), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 05:25:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2529 transitions. [2024-11-19 05:25:07,898 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2529 transitions. Word has length 9 [2024-11-19 05:25:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:07,899 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2529 transitions. [2024-11-19 05:25:07,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:25:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2529 transitions. [2024-11-19 05:25:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 05:25:07,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:07,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:25:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:25:07,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:07,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2144823555, now seen corresponding path program 1 times [2024-11-19 05:25:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335871420] [2024-11-19 05:25:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:08,254 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:25:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335871420] [2024-11-19 05:25:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335871420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:25:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347534016] [2024-11-19 05:25:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:08,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:25:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:25:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:25:08,260 INFO L87 Difference]: Start difference. First operand 1367 states and 2529 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:25:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:08,985 INFO L93 Difference]: Finished difference Result 3887 states and 7286 transitions. [2024-11-19 05:25:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:25:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-19 05:25:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:09,001 INFO L225 Difference]: With dead ends: 3887 [2024-11-19 05:25:09,002 INFO L226 Difference]: Without dead ends: 2721 [2024-11-19 05:25:09,006 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:25:09,007 INFO L432 NwaCegarLoop]: 2756 mSDtfsCounter, 1508 mSDsluCounter, 4760 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7516 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:09,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7516 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 05:25:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2024-11-19 05:25:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1369. [2024-11-19 05:25:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 862 states have (on average 1.7691415313225058) internal successors, (1525), 1363 states have internal predecessors, (1525), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 05:25:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2531 transitions. [2024-11-19 05:25:09,227 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2531 transitions. Word has length 64 [2024-11-19 05:25:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2531 transitions. [2024-11-19 05:25:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:25:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2531 transitions. [2024-11-19 05:25:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 05:25:09,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:09,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:25:09,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash 799809380, now seen corresponding path program 1 times [2024-11-19 05:25:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827353211] [2024-11-19 05:25:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:09,513 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:25:09,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:09,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827353211] [2024-11-19 05:25:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827353211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:09,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:25:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92165457] [2024-11-19 05:25:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:09,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:25:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:25:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:25:09,515 INFO L87 Difference]: Start difference. First operand 1369 states and 2531 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:25:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:09,638 INFO L93 Difference]: Finished difference Result 2692 states and 4992 transitions. [2024-11-19 05:25:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:25:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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 140 [2024-11-19 05:25:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:09,648 INFO L225 Difference]: With dead ends: 2692 [2024-11-19 05:25:09,648 INFO L226 Difference]: Without dead ends: 1327 [2024-11-19 05:25:09,654 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:25:09,657 INFO L432 NwaCegarLoop]: 2427 mSDtfsCounter, 30 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7262 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:25:09,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7262 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:25:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-19 05:25:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-11-19 05:25:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 820 states have (on average 1.7658536585365854) internal successors, (1448), 1321 states have internal predecessors, (1448), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 05:25:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2454 transitions. [2024-11-19 05:25:09,769 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2454 transitions. Word has length 140 [2024-11-19 05:25:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2454 transitions. [2024-11-19 05:25:09,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:25:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2454 transitions. [2024-11-19 05:25:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 05:25:09,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:09,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:25:09,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1221636368, now seen corresponding path program 1 times [2024-11-19 05:25:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338606508] [2024-11-19 05:25:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:09,902 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:25:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338606508] [2024-11-19 05:25:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338606508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:25:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128836121] [2024-11-19 05:25:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:25:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:09,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:25:09,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:25:09,906 INFO L87 Difference]: Start difference. First operand 1327 states and 2454 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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:25:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:10,035 INFO L93 Difference]: Finished difference Result 3875 states and 7228 transitions. [2024-11-19 05:25:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:25:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 140 [2024-11-19 05:25:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:10,049 INFO L225 Difference]: With dead ends: 3875 [2024-11-19 05:25:10,049 INFO L226 Difference]: Without dead ends: 2552 [2024-11-19 05:25:10,056 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:25:10,057 INFO L432 NwaCegarLoop]: 2891 mSDtfsCounter, 1261 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:10,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5323 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:25:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-19 05:25:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2024-11-19 05:25:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1543 states have (on average 1.7945560596241088) internal successors, (2769), 2544 states have internal predecessors, (2769), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-19 05:25:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4775 transitions. [2024-11-19 05:25:10,286 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4775 transitions. Word has length 140 [2024-11-19 05:25:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:10,287 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4775 transitions. [2024-11-19 05:25:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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:25:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4775 transitions. [2024-11-19 05:25:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:25:10,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:10,290 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:25:10,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:25:10,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1150455944, now seen corresponding path program 1 times [2024-11-19 05:25:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631904288] [2024-11-19 05:25:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:10,525 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:25:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631904288] [2024-11-19 05:25:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631904288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:25:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759443863] [2024-11-19 05:25:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:25:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:25:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:25:10,527 INFO L87 Difference]: Start difference. First operand 2550 states and 4775 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:25:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:10,659 INFO L93 Difference]: Finished difference Result 4767 states and 9085 transitions. [2024-11-19 05:25:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:25:10,659 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:25:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:10,678 INFO L225 Difference]: With dead ends: 4767 [2024-11-19 05:25:10,678 INFO L226 Difference]: Without dead ends: 2466 [2024-11-19 05:25:10,689 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:25:10,690 INFO L432 NwaCegarLoop]: 2344 mSDtfsCounter, 30 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7013 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:10,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7013 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:25:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2024-11-19 05:25:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2466. [2024-11-19 05:25:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 1459 states have (on average 1.792323509252913) internal successors, (2615), 2460 states have internal predecessors, (2615), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-19 05:25:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4621 transitions. [2024-11-19 05:25:10,922 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4621 transitions. Word has length 155 [2024-11-19 05:25:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:10,923 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4621 transitions. [2024-11-19 05:25:10,923 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:25:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4621 transitions. [2024-11-19 05:25:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:25:10,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:10,925 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:25:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:25:10,925 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash -21058180, now seen corresponding path program 1 times [2024-11-19 05:25:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798434576] [2024-11-19 05:25:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:11,193 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:25:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798434576] [2024-11-19 05:25:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798434576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:25:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323750391] [2024-11-19 05:25:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:25:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:11,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:25:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:25:11,196 INFO L87 Difference]: Start difference. First operand 2466 states and 4621 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:25:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:13,168 INFO L93 Difference]: Finished difference Result 4920 states and 9226 transitions. [2024-11-19 05:25:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:25:13,168 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:25:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:13,184 INFO L225 Difference]: With dead ends: 4920 [2024-11-19 05:25:13,184 INFO L226 Difference]: Without dead ends: 2545 [2024-11-19 05:25:13,192 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:25:13,192 INFO L432 NwaCegarLoop]: 2699 mSDtfsCounter, 4876 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 1269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5377 SdHoareTripleChecker+Valid, 5144 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1269 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:13,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5377 Valid, 5144 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1269 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 05:25:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2024-11-19 05:25:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1372. [2024-11-19 05:25:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 865 states have (on average 1.7190751445086705) internal successors, (1487), 1366 states have internal predecessors, (1487), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 05:25:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2493 transitions. [2024-11-19 05:25:13,448 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2493 transitions. Word has length 155 [2024-11-19 05:25:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:13,449 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 2493 transitions. [2024-11-19 05:25:13,449 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:25:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2493 transitions. [2024-11-19 05:25:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:25:13,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:13,450 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:25:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:25:13,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:13,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2009301040, now seen corresponding path program 1 times [2024-11-19 05:25:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680993171] [2024-11-19 05:25:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:14,140 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:25:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680993171] [2024-11-19 05:25:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680993171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:25:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84896311] [2024-11-19 05:25:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:25:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:25:14,143 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:25:14,144 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:25:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:14,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 05:25:14,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:25:14,448 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 15 treesize of output 1 [2024-11-19 05:25:14,627 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:25:14,633 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:25:14,637 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:25:14,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:25:14,777 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:25:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84896311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:25:14,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:25:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:25:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114551776] [2024-11-19 05:25:14,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:25:14,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:25:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:25:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:25:14,779 INFO L87 Difference]: Start difference. First operand 1372 states and 2493 transitions. Second operand has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:25:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:19,174 INFO L93 Difference]: Finished difference Result 5225 states and 9629 transitions. [2024-11-19 05:25:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:25:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 165 [2024-11-19 05:25:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:19,200 INFO L225 Difference]: With dead ends: 5225 [2024-11-19 05:25:19,200 INFO L226 Difference]: Without dead ends: 4101 [2024-11-19 05:25:19,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:25:19,206 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 9752 mSDsluCounter, 8758 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 2511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10758 SdHoareTripleChecker+Valid, 10649 SdHoareTripleChecker+Invalid, 6101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2511 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:19,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10758 Valid, 10649 Invalid, 6101 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2511 Valid, 3590 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-19 05:25:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2024-11-19 05:25:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 1719. [2024-11-19 05:25:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1208 states have (on average 1.609271523178808) internal successors, (1944), 1709 states have internal predecessors, (1944), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-19 05:25:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2956 transitions. [2024-11-19 05:25:19,587 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2956 transitions. Word has length 165 [2024-11-19 05:25:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2956 transitions. [2024-11-19 05:25:19,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:25:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2956 transitions. [2024-11-19 05:25:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:25:19,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:19,591 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:25:19,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:25:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:25:19,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash 145728567, now seen corresponding path program 1 times [2024-11-19 05:25:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640182878] [2024-11-19 05:25:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:22,771 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:25:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640182878] [2024-11-19 05:25:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640182878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:25:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404720406] [2024-11-19 05:25:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:25:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:25:22,774 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:25:22,775 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:25:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:23,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 05:25:23,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:25:23,288 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 15 treesize of output 1 [2024-11-19 05:25:23,450 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:25:23,539 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:25:23,621 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:25:23,728 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:25:23,732 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:25:23,737 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:25:23,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:25:24,121 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:25:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404720406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:25:24,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:25:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-19 05:25:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427106841] [2024-11-19 05:25:24,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:25:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 05:25:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 05:25:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2024-11-19 05:25:24,125 INFO L87 Difference]: Start difference. First operand 1719 states and 2956 transitions. Second operand has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:25:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:33,789 INFO L93 Difference]: Finished difference Result 10557 states and 19414 transitions. [2024-11-19 05:25:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:25:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 393 [2024-11-19 05:25:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:33,830 INFO L225 Difference]: With dead ends: 10557 [2024-11-19 05:25:33,830 INFO L226 Difference]: Without dead ends: 9433 [2024-11-19 05:25:33,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:25:33,836 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 26731 mSDsluCounter, 15194 mSDsCounter, 0 mSdLazyCounter, 8014 mSolverCounterSat, 4973 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29743 SdHoareTripleChecker+Valid, 17085 SdHoareTripleChecker+Invalid, 12987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4973 IncrementalHoareTripleChecker+Valid, 8014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:33,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29743 Valid, 17085 Invalid, 12987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4973 Valid, 8014 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-19 05:25:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2024-11-19 05:25:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 2583. [2024-11-19 05:25:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2066 states have (on average 1.4956437560503388) internal successors, (3090), 2567 states have internal predecessors, (3090), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-19 05:25:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4114 transitions. [2024-11-19 05:25:34,715 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4114 transitions. Word has length 393 [2024-11-19 05:25:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:34,716 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 4114 transitions. [2024-11-19 05:25:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:25:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4114 transitions. [2024-11-19 05:25:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:25:34,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:34,728 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:25:34,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:25:34,928 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,SelfDestructingSolverStorable7 [2024-11-19 05:25:34,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:34,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1299090885, now seen corresponding path program 2 times [2024-11-19 05:25:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246730515] [2024-11-19 05:25:34,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:25:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:35,161 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:25:35,162 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:25:35,341 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:25:35,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246730515] [2024-11-19 05:25:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246730515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:25:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541512432] [2024-11-19 05:25:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:25:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:25:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:25:35,343 INFO L87 Difference]: Start difference. First operand 2583 states and 4114 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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:25:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:35,940 INFO L93 Difference]: Finished difference Result 3721 states and 6296 transitions. [2024-11-19 05:25:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:25:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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:25:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:35,953 INFO L225 Difference]: With dead ends: 3721 [2024-11-19 05:25:35,954 INFO L226 Difference]: Without dead ends: 2598 [2024-11-19 05:25:35,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:25:35,963 INFO L432 NwaCegarLoop]: 2347 mSDtfsCounter, 52 mSDsluCounter, 11376 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 13723 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:35,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 13723 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:25:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2024-11-19 05:25:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2594. [2024-11-19 05:25:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2077 states have (on average 1.4930187770823302) internal successors, (3101), 2578 states have internal predecessors, (3101), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-19 05:25:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 4125 transitions. [2024-11-19 05:25:36,156 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 4125 transitions. Word has length 849 [2024-11-19 05:25:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 2594 states and 4125 transitions. [2024-11-19 05:25:36,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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:25:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 4125 transitions. [2024-11-19 05:25:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:25:36,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:36,169 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:25:36,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:25:36,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -598782236, now seen corresponding path program 1 times [2024-11-19 05:25:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236947465] [2024-11-19 05:25:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:38,571 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:25:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236947465] [2024-11-19 05:25:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236947465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:25:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786230923] [2024-11-19 05:25:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:38,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:25:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:38,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:25:38,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:25:38,573 INFO L87 Difference]: Start difference. First operand 2594 states and 4125 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:25:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:38,926 INFO L93 Difference]: Finished difference Result 3733 states and 6305 transitions. [2024-11-19 05:25:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:25:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:25:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:38,938 INFO L225 Difference]: With dead ends: 3733 [2024-11-19 05:25:38,938 INFO L226 Difference]: Without dead ends: 2599 [2024-11-19 05:25:38,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:25:38,942 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 21 mSDsluCounter, 9109 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11463 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:38,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11463 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:25:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2024-11-19 05:25:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2598. [2024-11-19 05:25:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2081 states have (on average 1.4925516578567997) internal successors, (3106), 2582 states have internal predecessors, (3106), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-19 05:25:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4130 transitions. [2024-11-19 05:25:39,130 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4130 transitions. Word has length 850 [2024-11-19 05:25:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 4130 transitions. [2024-11-19 05:25:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:25:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4130 transitions. [2024-11-19 05:25:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:25:39,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:39,145 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:25:39,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:25:39,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:39,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1829868424, now seen corresponding path program 1 times [2024-11-19 05:25:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819705669] [2024-11-19 05:25:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:41,116 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:25:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819705669] [2024-11-19 05:25:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819705669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:25:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715900306] [2024-11-19 05:25:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:25:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:25:41,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:25:41,118 INFO L87 Difference]: Start difference. First operand 2598 states and 4130 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:25:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:41,432 INFO L93 Difference]: Finished difference Result 3744 states and 6319 transitions. [2024-11-19 05:25:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:25:41,433 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:25:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:41,442 INFO L225 Difference]: With dead ends: 3744 [2024-11-19 05:25:41,442 INFO L226 Difference]: Without dead ends: 2606 [2024-11-19 05:25:41,446 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:25:41,447 INFO L432 NwaCegarLoop]: 2347 mSDtfsCounter, 25 mSDsluCounter, 11410 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13757 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13757 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:25:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2024-11-19 05:25:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2598. [2024-11-19 05:25:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2081 states have (on average 1.4925516578567997) internal successors, (3106), 2582 states have internal predecessors, (3106), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-19 05:25:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4130 transitions. [2024-11-19 05:25:41,625 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4130 transitions. Word has length 850 [2024-11-19 05:25:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:41,626 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 4130 transitions. [2024-11-19 05:25:41,626 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:25:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4130 transitions. [2024-11-19 05:25:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:25:41,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:41,633 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:25:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:25:41,633 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:41,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1187726993, now seen corresponding path program 1 times [2024-11-19 05:25:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131326105] [2024-11-19 05:25:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:43,431 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:25:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131326105] [2024-11-19 05:25:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131326105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:43,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:43,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:25:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165682612] [2024-11-19 05:25:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:43,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:25:43,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:25:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:25:43,433 INFO L87 Difference]: Start difference. First operand 2598 states and 4130 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:25:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:43,857 INFO L93 Difference]: Finished difference Result 3747 states and 6324 transitions. [2024-11-19 05:25:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:25:43,858 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:25:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:43,867 INFO L225 Difference]: With dead ends: 3747 [2024-11-19 05:25:43,867 INFO L226 Difference]: Without dead ends: 2609 [2024-11-19 05:25:43,871 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:25:43,872 INFO L432 NwaCegarLoop]: 2348 mSDtfsCounter, 32 mSDsluCounter, 16019 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 18367 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:43,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 18367 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:25:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2024-11-19 05:25:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2606. [2024-11-19 05:25:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2089 states have (on average 1.4916227860220201) internal successors, (3116), 2590 states have internal predecessors, (3116), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-19 05:25:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 4140 transitions. [2024-11-19 05:25:44,046 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 4140 transitions. Word has length 851 [2024-11-19 05:25:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:44,047 INFO L471 AbstractCegarLoop]: Abstraction has 2606 states and 4140 transitions. [2024-11-19 05:25:44,047 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:25:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 4140 transitions. [2024-11-19 05:25:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:25:44,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:44,052 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:25:44,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:25:44,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1716063547, now seen corresponding path program 1 times [2024-11-19 05:25:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422544392] [2024-11-19 05:25:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:44,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:52,905 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:25:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422544392] [2024-11-19 05:25:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422544392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:25:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272750503] [2024-11-19 05:25:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:52,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:25:52,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:25:52,907 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:25:52,908 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:25:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:53,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 4160 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 05:25:53,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:25:53,936 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 15 treesize of output 1 [2024-11-19 05:25:54,072 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:25:54,146 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:25:54,212 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:25:54,277 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:25:54,342 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:25:54,403 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:25:54,473 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:25:54,542 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:25:54,603 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:25:54,668 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:25:54,672 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:25:54,677 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:25:54,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:25:55,536 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:25:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272750503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:25:55,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:25:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2024-11-19 05:25:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709467454] [2024-11-19 05:25:55,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:25:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 05:25:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 05:25:55,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 05:25:55,541 INFO L87 Difference]: Start difference. First operand 2606 states and 4140 transitions. Second operand has 38 states, 38 states have (on average 43.078947368421055) internal successors, (1637), 38 states have internal predecessors, (1637), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)