./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:24:37,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:24:37,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:24:37,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:24:37,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:24:37,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:24:37,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:24:37,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:24:37,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:24:37,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:24:37,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:24:37,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:24:37,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:24:37,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:24:37,652 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:24:37,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:24:37,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:24:37,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:24:37,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:24:37,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:24:37,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:24:37,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:24:37,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:24:37,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:24:37,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:24:37,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:24:37,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:24:37,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:24:37,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:24:37,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:24:37,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:24:37,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:24:37,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:24:37,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:24:37,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:24:37,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:24:37,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:24:37,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:24:37,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:24:37,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:24:37,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:24:37,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:24:37,665 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 -> 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 [2024-11-19 05:24:37,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:24:37,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:24:37,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:24:37,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:24:37,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:24:37,965 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_test8-1.i [2024-11-19 05:24:39,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:24:39,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:24:39,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2024-11-19 05:24:39,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14b05386/65d8a0f789c14fe5a49b1dfb7d5ec0cd/FLAGddb133667 [2024-11-19 05:24:39,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14b05386/65d8a0f789c14fe5a49b1dfb7d5ec0cd [2024-11-19 05:24:39,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:24:39,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:24:39,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:24:39,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:24:39,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:24:39,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:24:39" (1/1) ... [2024-11-19 05:24:39,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3313f8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:39, skipping insertion in model container [2024-11-19 05:24:39,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:24:39" (1/1) ... [2024-11-19 05:24:39,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:24:40,306 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_test8-1.i[33021,33034] [2024-11-19 05:24:40,465 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_test8-1.i[45234,45247] [2024-11-19 05:24:40,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:24:40,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:24:40,538 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_test8-1.i[33021,33034] [2024-11-19 05:24:40,608 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_test8-1.i[45234,45247] [2024-11-19 05:24:40,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:24:40,658 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:24:40,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40 WrapperNode [2024-11-19 05:24:40,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:24:40,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:24:40,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:24:40,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:24:40,669 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:24:40" (1/1) ... [2024-11-19 05:24:40,705 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:24:40" (1/1) ... [2024-11-19 05:24:40,788 INFO L138 Inliner]: procedures = 177, calls = 289, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-11-19 05:24:40,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:24:40,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:24:40,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:24:40,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:24:40,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,909 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-19 05:24:40,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:40,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:41,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:24:41,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:24:41,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:24:41,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:24:41,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (1/1) ... [2024-11-19 05:24:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:24:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:41,050 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:24:41,059 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:24:41,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:24:41,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:24:41,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:24:41,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 05:24:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 05:24:41,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:24:41,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:24:41,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:24:41,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:24:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:24:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:24:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:24:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:24:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:24:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-19 05:24:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:24:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:24:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:24:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:24:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:24:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:24:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:24:41,339 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:24:41,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:24:42,869 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2024-11-19 05:24:42,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:24:42,888 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:24:42,889 INFO L316 CfgBuilder]: Removed 62 assume(true) statements. [2024-11-19 05:24:42,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:24:42 BoogieIcfgContainer [2024-11-19 05:24:42,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:24:42,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:24:42,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:24:42,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:24:42,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:24:39" (1/3) ... [2024-11-19 05:24:42,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f920e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:24:42, skipping insertion in model container [2024-11-19 05:24:42,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:40" (2/3) ... [2024-11-19 05:24:42,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f920e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:24:42, skipping insertion in model container [2024-11-19 05:24:42,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:24:42" (3/3) ... [2024-11-19 05:24:42,898 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-1.i [2024-11-19 05:24:42,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:24:42,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:24:42,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:24:42,999 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;@1ff9f620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:24:43,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:24:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 410 states have (on average 1.6268292682926828) internal successors, (667), 427 states have internal predecessors, (667), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 05:24:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 05:24:43,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:43,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:24:43,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:43,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -351686983, now seen corresponding path program 1 times [2024-11-19 05:24:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469258154] [2024-11-19 05:24:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:43,199 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:24:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469258154] [2024-11-19 05:24:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469258154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:43,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:24:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946087398] [2024-11-19 05:24:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:43,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:24:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:24:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:24:43,238 INFO L87 Difference]: Start difference. First operand has 436 states, 410 states have (on average 1.6268292682926828) internal successors, (667), 427 states have internal predecessors, (667), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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:24:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:43,329 INFO L93 Difference]: Finished difference Result 870 states and 1429 transitions. [2024-11-19 05:24:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:24:43,331 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:24:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:43,347 INFO L225 Difference]: With dead ends: 870 [2024-11-19 05:24:43,349 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 05:24:43,357 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:24:43,362 INFO L432 NwaCegarLoop]: 639 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, 639 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:24:43,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:24:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 05:24:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-19 05:24:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 407 states have (on average 1.461916461916462) internal successors, (595), 423 states have internal predecessors, (595), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 05:24:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 635 transitions. [2024-11-19 05:24:43,490 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 635 transitions. Word has length 9 [2024-11-19 05:24:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:43,490 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 635 transitions. [2024-11-19 05:24:43,491 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:24:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 635 transitions. [2024-11-19 05:24:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 05:24:43,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:43,496 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:24:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:24:43,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 559678017, now seen corresponding path program 1 times [2024-11-19 05:24:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206684228] [2024-11-19 05:24:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:43,976 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:24:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206684228] [2024-11-19 05:24:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206684228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:24:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737150513] [2024-11-19 05:24:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:24:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:43,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:24:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:24:43,983 INFO L87 Difference]: Start difference. First operand 432 states and 635 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:24:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:44,182 INFO L93 Difference]: Finished difference Result 1045 states and 1537 transitions. [2024-11-19 05:24:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:24:44,183 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:24:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:44,189 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 05:24:44,191 INFO L226 Difference]: Without dead ends: 817 [2024-11-19 05:24:44,192 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:24:44,194 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 547 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:44,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1840 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:24:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-19 05:24:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 434. [2024-11-19 05:24:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 425 states have internal predecessors, (597), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 05:24:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 637 transitions. [2024-11-19 05:24:44,230 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 637 transitions. Word has length 64 [2024-11-19 05:24:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:44,230 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 637 transitions. [2024-11-19 05:24:44,230 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:24:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 637 transitions. [2024-11-19 05:24:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 05:24:44,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:44,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:24:44,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:24:44,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:44,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash 616256236, now seen corresponding path program 1 times [2024-11-19 05:24:44,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:44,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657293191] [2024-11-19 05:24:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:44,611 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:24:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657293191] [2024-11-19 05:24:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657293191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:24:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094980836] [2024-11-19 05:24:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:24:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:24:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:24:44,618 INFO L87 Difference]: Start difference. First operand 434 states and 637 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:24:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:44,723 INFO L93 Difference]: Finished difference Result 822 states and 1204 transitions. [2024-11-19 05:24:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:24:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 05:24:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:44,727 INFO L225 Difference]: With dead ends: 822 [2024-11-19 05:24:44,728 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 05:24:44,729 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:24:44,732 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 30 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1580 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:24:44,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1580 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:24:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 05:24:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-19 05:24:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 367 states have (on average 1.4168937329700273) internal successors, (520), 383 states have internal predecessors, (520), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 05:24:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 560 transitions. [2024-11-19 05:24:44,753 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 560 transitions. Word has length 85 [2024-11-19 05:24:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:44,753 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 560 transitions. [2024-11-19 05:24:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:24:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 560 transitions. [2024-11-19 05:24:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 05:24:44,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:44,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:24:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:24:44,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:44,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 772689888, now seen corresponding path program 1 times [2024-11-19 05:24:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22606897] [2024-11-19 05:24:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:44,982 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:24:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22606897] [2024-11-19 05:24:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22606897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:24:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816050505] [2024-11-19 05:24:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:24:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:24:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:24:44,989 INFO L87 Difference]: Start difference. First operand 392 states and 560 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:24:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:45,109 INFO L93 Difference]: Finished difference Result 1032 states and 1478 transitions. [2024-11-19 05:24:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:24:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 05:24:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:45,114 INFO L225 Difference]: With dead ends: 1032 [2024-11-19 05:24:45,115 INFO L226 Difference]: Without dead ends: 644 [2024-11-19 05:24:45,118 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:24:45,119 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 295 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:45,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1269 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:24:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-19 05:24:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2024-11-19 05:24:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 615 states have (on average 1.424390243902439) internal successors, (876), 631 states have internal predecessors, (876), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 918 transitions. [2024-11-19 05:24:45,155 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 918 transitions. Word has length 85 [2024-11-19 05:24:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:45,156 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 918 transitions. [2024-11-19 05:24:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:24:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 918 transitions. [2024-11-19 05:24:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 05:24:45,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:45,160 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:45,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:24:45,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:45,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1168982230, now seen corresponding path program 1 times [2024-11-19 05:24:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877806027] [2024-11-19 05:24:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:24:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877806027] [2024-11-19 05:24:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877806027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:24:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406758726] [2024-11-19 05:24:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:45,702 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:24:45,704 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:24:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:46,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 05:24:46,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:24:46,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:24:46,112 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 16 treesize of output 17 [2024-11-19 05:24:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:24:47,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:24:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406758726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:24:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 05:24:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402049035] [2024-11-19 05:24:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:24:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:24:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:24:47,084 INFO L87 Difference]: Start difference. First operand 641 states and 918 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:48,747 INFO L93 Difference]: Finished difference Result 1537 states and 2203 transitions. [2024-11-19 05:24:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:24:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-19 05:24:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:48,754 INFO L225 Difference]: With dead ends: 1537 [2024-11-19 05:24:48,754 INFO L226 Difference]: Without dead ends: 940 [2024-11-19 05:24:48,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 05:24:48,759 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 588 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 3696 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 05:24:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-19 05:24:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 641. [2024-11-19 05:24:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 615 states have (on average 1.4227642276422765) internal successors, (875), 631 states have internal predecessors, (875), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 917 transitions. [2024-11-19 05:24:48,786 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 917 transitions. Word has length 100 [2024-11-19 05:24:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:48,788 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 917 transitions. [2024-11-19 05:24:48,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 917 transitions. [2024-11-19 05:24:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 05:24:48,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:48,793 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:48,815 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:24:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:48,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1907265882, now seen corresponding path program 1 times [2024-11-19 05:24:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143418169] [2024-11-19 05:24:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:24:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143418169] [2024-11-19 05:24:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143418169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:24:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194969096] [2024-11-19 05:24:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:49,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:49,460 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:24:49,461 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:24:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:49,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 05:24:49,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:24:49,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:24:49,991 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 16 treesize of output 17 [2024-11-19 05:24:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:24:50,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:24:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194969096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:24:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2024-11-19 05:24:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360410662] [2024-11-19 05:24:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:50,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 05:24:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 05:24:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:24:50,970 INFO L87 Difference]: Start difference. First operand 641 states and 917 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:52,750 INFO L93 Difference]: Finished difference Result 1552 states and 2223 transitions. [2024-11-19 05:24:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 05:24:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-19 05:24:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:52,756 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 05:24:52,756 INFO L226 Difference]: Without dead ends: 960 [2024-11-19 05:24:52,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 05:24:52,758 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 651 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:52,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 4512 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 05:24:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-19 05:24:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 657. [2024-11-19 05:24:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 631 states have (on average 1.4183835182250397) internal successors, (895), 647 states have internal predecessors, (895), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 937 transitions. [2024-11-19 05:24:52,790 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 937 transitions. Word has length 101 [2024-11-19 05:24:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:52,791 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 937 transitions. [2024-11-19 05:24:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 937 transitions. [2024-11-19 05:24:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 05:24:52,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:52,794 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:52,815 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:24:52,995 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,SelfDestructingSolverStorable5 [2024-11-19 05:24:52,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash 281528894, now seen corresponding path program 1 times [2024-11-19 05:24:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40695138] [2024-11-19 05:24:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:24:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:53,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40695138] [2024-11-19 05:24:53,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40695138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:53,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:53,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:24:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187157299] [2024-11-19 05:24:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:53,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:24:53,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:24:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:24:53,371 INFO L87 Difference]: Start difference. First operand 657 states and 937 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:53,672 INFO L93 Difference]: Finished difference Result 1266 states and 1819 transitions. [2024-11-19 05:24:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:24:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-19 05:24:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:53,677 INFO L225 Difference]: With dead ends: 1266 [2024-11-19 05:24:53,677 INFO L226 Difference]: Without dead ends: 667 [2024-11-19 05:24:53,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:24:53,680 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 14 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:53,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2866 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:24:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-19 05:24:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2024-11-19 05:24:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 639 states have (on average 1.4162754303599374) internal successors, (905), 655 states have internal predecessors, (905), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 947 transitions. [2024-11-19 05:24:53,717 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 947 transitions. Word has length 102 [2024-11-19 05:24:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 947 transitions. [2024-11-19 05:24:53,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 947 transitions. [2024-11-19 05:24:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 05:24:53,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:53,720 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:53,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:24:53,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1195725371, now seen corresponding path program 1 times [2024-11-19 05:24:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:53,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047302643] [2024-11-19 05:24:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:24:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047302643] [2024-11-19 05:24:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047302643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:24:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:24:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169009182] [2024-11-19 05:24:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:24:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:24:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:24:54,092 INFO L87 Difference]: Start difference. First operand 665 states and 947 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:54,312 INFO L93 Difference]: Finished difference Result 1281 states and 1839 transitions. [2024-11-19 05:24:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:24:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-19 05:24:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:54,316 INFO L225 Difference]: With dead ends: 1281 [2024-11-19 05:24:54,316 INFO L226 Difference]: Without dead ends: 671 [2024-11-19 05:24:54,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:24:54,318 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:54,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1965 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:24:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-19 05:24:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-11-19 05:24:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 661 states have internal predecessors, (911), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 953 transitions. [2024-11-19 05:24:54,339 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 953 transitions. Word has length 102 [2024-11-19 05:24:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 953 transitions. [2024-11-19 05:24:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 953 transitions. [2024-11-19 05:24:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 05:24:54,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:54,341 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:24:54,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:54,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1344710638, now seen corresponding path program 1 times [2024-11-19 05:24:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989654161] [2024-11-19 05:24:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:24:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989654161] [2024-11-19 05:24:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989654161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:24:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077339053] [2024-11-19 05:24:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:54,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:54,674 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:24:54,675 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:24:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:55,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 05:24:55,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:24:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:24:55,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:24:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077339053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:24:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2024-11-19 05:24:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867776773] [2024-11-19 05:24:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:24:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:55,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:24:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:24:55,098 INFO L87 Difference]: Start difference. First operand 671 states and 953 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:55,406 INFO L93 Difference]: Finished difference Result 1297 states and 1856 transitions. [2024-11-19 05:24:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 05:24:55,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-19 05:24:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:55,410 INFO L225 Difference]: With dead ends: 1297 [2024-11-19 05:24:55,410 INFO L226 Difference]: Without dead ends: 677 [2024-11-19 05:24:55,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:24:55,415 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 43 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:55,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2894 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:24:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-19 05:24:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 659. [2024-11-19 05:24:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 633 states have (on average 1.410742496050553) internal successors, (893), 649 states have internal predecessors, (893), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 05:24:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 935 transitions. [2024-11-19 05:24:55,436 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 935 transitions. Word has length 103 [2024-11-19 05:24:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:55,437 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 935 transitions. [2024-11-19 05:24:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:24:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 935 transitions. [2024-11-19 05:24:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 05:24:55,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:55,438 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 05:24:55,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 05:24:55,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:55,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1849641193, now seen corresponding path program 1 times [2024-11-19 05:24:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551619607] [2024-11-19 05:24:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:24:56,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551619607] [2024-11-19 05:24:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551619607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:24:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631496956] [2024-11-19 05:24:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:56,071 INFO L229 MonitoredProcess]: Starting monitored process 5 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:24:56,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 05:24:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:56,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 05:24:56,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:24:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:24:56,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:24:56,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631496956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:24:56,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:24:56,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-19 05:24:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952631579] [2024-11-19 05:24:56,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:24:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:24:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:24:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:24:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:24:56,783 INFO L87 Difference]: Start difference. First operand 659 states and 935 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 05:24:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:24:56,820 INFO L93 Difference]: Finished difference Result 1221 states and 1746 transitions. [2024-11-19 05:24:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:24:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-19 05:24:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:24:56,825 INFO L225 Difference]: With dead ends: 1221 [2024-11-19 05:24:56,825 INFO L226 Difference]: Without dead ends: 662 [2024-11-19 05:24:56,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:24:56,827 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:24:56,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:24:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-19 05:24:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-19 05:24:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 635 states have (on average 1.411023622047244) internal successors, (896), 652 states have internal predecessors, (896), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 05:24:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 939 transitions. [2024-11-19 05:24:56,849 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 939 transitions. Word has length 103 [2024-11-19 05:24:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:24:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 939 transitions. [2024-11-19 05:24:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 05:24:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 939 transitions. [2024-11-19 05:24:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 05:24:56,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:24:56,852 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] [2024-11-19 05:24:56,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 05:24:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:57,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:24:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:24:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash -602232331, now seen corresponding path program 1 times [2024-11-19 05:24:57,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:24:57,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727020011] [2024-11-19 05:24:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:24:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:24:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:24:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727020011] [2024-11-19 05:24:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727020011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:24:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030241624] [2024-11-19 05:24:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:24:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:24:57,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:24:57,518 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:57,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 05:24:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:24:57,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:24:57,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:25:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 05:25:15,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:25:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030241624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:25:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-19 05:25:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481434640] [2024-11-19 05:25:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:25:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:15,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:25:15,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:25:15,047 INFO L87 Difference]: Start difference. First operand 662 states and 939 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:25:18,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 05:25:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 05:25:23,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 05:25:27,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 05:25:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:28,064 INFO L93 Difference]: Finished difference Result 1271 states and 1819 transitions. [2024-11-19 05:25:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:25:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-11-19 05:25:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:28,068 INFO L225 Difference]: With dead ends: 1271 [2024-11-19 05:25:28,068 INFO L226 Difference]: Without dead ends: 672 [2024-11-19 05:25:28,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:25:28,070 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 12 mSDsluCounter, 2336 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:28,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2873 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2024-11-19 05:25:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-19 05:25:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 662. [2024-11-19 05:25:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 635 states have (on average 1.411023622047244) internal successors, (896), 652 states have internal predecessors, (896), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 05:25:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 939 transitions. [2024-11-19 05:25:28,089 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 939 transitions. Word has length 105 [2024-11-19 05:25:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 939 transitions. [2024-11-19 05:25:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:25:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 939 transitions. [2024-11-19 05:25:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 05:25:28,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:28,090 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] [2024-11-19 05:25:28,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 05:25:28,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 05:25:28,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:28,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash -746803739, now seen corresponding path program 1 times [2024-11-19 05:25:28,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:28,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083730122] [2024-11-19 05:25:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 05:25:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083730122] [2024-11-19 05:25:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083730122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:25:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:25:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 05:25:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602237255] [2024-11-19 05:25:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:25:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:25:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:25:28,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:25:28,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:25:28,799 INFO L87 Difference]: Start difference. First operand 662 states and 939 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:25:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:25:29,275 INFO L93 Difference]: Finished difference Result 1293 states and 1848 transitions. [2024-11-19 05:25:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:25:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2024-11-19 05:25:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:25:29,279 INFO L225 Difference]: With dead ends: 1293 [2024-11-19 05:25:29,279 INFO L226 Difference]: Without dead ends: 694 [2024-11-19 05:25:29,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:25:29,281 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 23 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:25:29,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3890 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:25:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-19 05:25:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-19 05:25:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 655 states have (on average 1.4045801526717556) internal successors, (920), 672 states have internal predecessors, (920), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 05:25:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 963 transitions. [2024-11-19 05:25:29,303 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 963 transitions. Word has length 107 [2024-11-19 05:25:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:25:29,304 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 963 transitions. [2024-11-19 05:25:29,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:25:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 963 transitions. [2024-11-19 05:25:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 05:25:29,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:25:29,305 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] [2024-11-19 05:25:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:25:29,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:25:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:25:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1666553801, now seen corresponding path program 1 times [2024-11-19 05:25:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:25:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081251494] [2024-11-19 05:25:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:25:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:25:29,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:25:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081251494] [2024-11-19 05:25:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081251494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:25:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057995725] [2024-11-19 05:25:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:25:29,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:25:29,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:25:29,737 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 05:25:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:25:30,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-19 05:25:30,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:25:30,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 05:25:30,513 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 19 treesize of output 1 [2024-11-19 05:25:30,516 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 19 treesize of output 1 [2024-11-19 05:25:30,540 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-19 05:25:30,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-19 05:25:30,587 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 22 treesize of output 10 [2024-11-19 05:25:30,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 05:25:30,715 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 05:25:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-19 05:25:35,038 INFO L224 Elim1Store]: Index analysis took 279 ms