./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:05:12,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:05:12,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:05:12,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:05:12,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:05:12,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:05:12,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:05:12,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:05:12,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:05:12,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:05:12,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:05:12,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:05:12,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:05:12,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:05:12,846 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:05:12,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:05:12,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:05:12,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:05:12,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:05:12,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:05:12,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:05:12,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:05:12,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:05:12,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:05:12,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:05:12,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:05:12,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:05:12,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:05:12,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:05:12,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:05:12,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:05:12,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:05:12,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:05:12,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:05:12,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:05:12,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:05:12,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:05:12,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:05:12,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:05:12,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:05:12,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:05:12,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:05:12,857 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-19 05:05:13,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:05:13,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:05:13,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:05:13,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:05:13,166 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:05:13,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-19 05:05:14,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:05:15,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:05:15,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-19 05:05:15,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ada62e7a/e650323c61a24df7aed9b02e5d48225c/FLAGa6288f4d3 [2024-11-19 05:05:15,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ada62e7a/e650323c61a24df7aed9b02e5d48225c [2024-11-19 05:05:15,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:05:15,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:05:15,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:05:15,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:05:15,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:05:15,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:15,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e0ba97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15, skipping insertion in model container [2024-11-19 05:05:15,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:15,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:05:15,581 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_BER_nondet_test2-2.i[37435,37448] [2024-11-19 05:05:15,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:05:15,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:05:15,800 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_BER_nondet_test2-2.i[37435,37448] [2024-11-19 05:05:15,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:05:15,923 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:05:15,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15 WrapperNode [2024-11-19 05:05:15,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:05:15,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:05:15,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:05:15,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:05:15,933 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:05:15" (1/1) ... [2024-11-19 05:05:15,964 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:05:15" (1/1) ... [2024-11-19 05:05:16,100 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1443 [2024-11-19 05:05:16,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:05:16,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:05:16,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:05:16,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:05:16,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,214 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [34, 2, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2024-11-19 05:05:16,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:05:16,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:05:16,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:05:16,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:05:16,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (1/1) ... [2024-11-19 05:05:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:05:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:05:16,344 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:05:16,346 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:05:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:05:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:05:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:05:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:05:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:05:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:05:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:05:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:05:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:05:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:05:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:05:16,583 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:05:16,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:05:18,032 INFO L? ?]: Removed 321 outVars from TransFormulas that were not future-live. [2024-11-19 05:05:18,032 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:05:18,062 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:05:18,062 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:05:18,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:18 BoogieIcfgContainer [2024-11-19 05:05:18,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:05:18,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:05:18,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:05:18,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:05:18,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:05:15" (1/3) ... [2024-11-19 05:05:18,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b1c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:18, skipping insertion in model container [2024-11-19 05:05:18,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:15" (2/3) ... [2024-11-19 05:05:18,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b1c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:18, skipping insertion in model container [2024-11-19 05:05:18,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:18" (3/3) ... [2024-11-19 05:05:18,078 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-2.i [2024-11-19 05:05:18,096 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:05:18,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 05:05:18,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:05:18,183 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;@78fba250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:05:18,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 05:05:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 395 states have (on average 1.620253164556962) internal successors, (640), 396 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 05:05:18,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:18,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:18,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -271903450, now seen corresponding path program 1 times [2024-11-19 05:05:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500442752] [2024-11-19 05:05:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:18,385 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:05:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500442752] [2024-11-19 05:05:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500442752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:05:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357517486] [2024-11-19 05:05:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:05:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:05:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:05:18,415 INFO L87 Difference]: Start difference. First operand has 401 states, 395 states have (on average 1.620253164556962) internal successors, (640), 396 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:05:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:18,490 INFO L93 Difference]: Finished difference Result 799 states and 1288 transitions. [2024-11-19 05:05:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:05:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-19 05:05:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:18,510 INFO L225 Difference]: With dead ends: 799 [2024-11-19 05:05:18,511 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 05:05:18,517 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:05:18,520 INFO L432 NwaCegarLoop]: 578 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, 578 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:05:18,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:05:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 05:05:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-19 05:05:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.453781512605042) internal successors, (519), 357 states have internal predecessors, (519), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 525 transitions. [2024-11-19 05:05:18,599 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 525 transitions. Word has length 11 [2024-11-19 05:05:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:18,601 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 525 transitions. [2024-11-19 05:05:18,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:05:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 525 transitions. [2024-11-19 05:05:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 05:05:18,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:18,607 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] [2024-11-19 05:05:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:05:18,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1335073267, now seen corresponding path program 1 times [2024-11-19 05:05:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922546912] [2024-11-19 05:05:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:19,056 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:05:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922546912] [2024-11-19 05:05:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922546912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:05:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144958165] [2024-11-19 05:05:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:05:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:05:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:05:19,065 INFO L87 Difference]: Start difference. First operand 362 states and 525 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:05:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:19,221 INFO L93 Difference]: Finished difference Result 479 states and 693 transitions. [2024-11-19 05:05:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:05:19,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-11-19 05:05:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:19,223 INFO L225 Difference]: With dead ends: 479 [2024-11-19 05:05:19,224 INFO L226 Difference]: Without dead ends: 320 [2024-11-19 05:05:19,224 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:05:19,226 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1250 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:05:19,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1250 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:05:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-19 05:05:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-19 05:05:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.403174603174603) internal successors, (442), 315 states have internal predecessors, (442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2024-11-19 05:05:19,252 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 66 [2024-11-19 05:05:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:19,252 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2024-11-19 05:05:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:05:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2024-11-19 05:05:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 05:05:19,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:19,255 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] [2024-11-19 05:05:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:05:19,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1779429657, now seen corresponding path program 1 times [2024-11-19 05:05:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39781258] [2024-11-19 05:05:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:19,819 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:05:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39781258] [2024-11-19 05:05:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39781258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:19,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:05:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326833057] [2024-11-19 05:05:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:19,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:05:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:05:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:05:19,825 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:05:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:19,962 INFO L93 Difference]: Finished difference Result 752 states and 1048 transitions. [2024-11-19 05:05:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:05:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2024-11-19 05:05:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:19,968 INFO L225 Difference]: With dead ends: 752 [2024-11-19 05:05:19,968 INFO L226 Difference]: Without dead ends: 632 [2024-11-19 05:05:19,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:05:19,971 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 428 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:19,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:05:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-19 05:05:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 322. [2024-11-19 05:05:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 317 states have (on average 1.4006309148264984) internal successors, (444), 317 states have internal predecessors, (444), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions. [2024-11-19 05:05:20,002 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 66 [2024-11-19 05:05:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:20,003 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 450 transitions. [2024-11-19 05:05:20,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:05:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions. [2024-11-19 05:05:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 05:05:20,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:20,012 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:20,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:05:20,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 857389398, now seen corresponding path program 1 times [2024-11-19 05:05:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:20,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475180475] [2024-11-19 05:05:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:20,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:05:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:20,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475180475] [2024-11-19 05:05:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475180475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:20,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:20,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:05:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371262100] [2024-11-19 05:05:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:20,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:05:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:05:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:05:20,331 INFO L87 Difference]: Start difference. First operand 322 states and 450 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:05:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:20,411 INFO L93 Difference]: Finished difference Result 597 states and 829 transitions. [2024-11-19 05:05:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:05:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 142 [2024-11-19 05:05:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:20,415 INFO L225 Difference]: With dead ends: 597 [2024-11-19 05:05:20,415 INFO L226 Difference]: Without dead ends: 280 [2024-11-19 05:05:20,416 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:05:20,419 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 30 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1001 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:05:20,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1001 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:05:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-19 05:05:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-19 05:05:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 275 states have internal predecessors, (367), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2024-11-19 05:05:20,428 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 142 [2024-11-19 05:05:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2024-11-19 05:05:20,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:05:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2024-11-19 05:05:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 05:05:20,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:20,431 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:05:20,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -172432950, now seen corresponding path program 1 times [2024-11-19 05:05:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393903030] [2024-11-19 05:05:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:05:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393903030] [2024-11-19 05:05:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393903030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:20,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:05:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595830474] [2024-11-19 05:05:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:05:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:05:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:05:20,605 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:05:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:20,671 INFO L93 Difference]: Finished difference Result 738 states and 988 transitions. [2024-11-19 05:05:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:05:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 142 [2024-11-19 05:05:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:20,675 INFO L225 Difference]: With dead ends: 738 [2024-11-19 05:05:20,675 INFO L226 Difference]: Without dead ends: 463 [2024-11-19 05:05:20,676 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:05:20,676 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 178 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:20,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 813 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:05:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-19 05:05:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2024-11-19 05:05:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.3399122807017543) internal successors, (611), 456 states have internal predecessors, (611), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 617 transitions. [2024-11-19 05:05:20,692 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 617 transitions. Word has length 142 [2024-11-19 05:05:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:20,693 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 617 transitions. [2024-11-19 05:05:20,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:05:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 617 transitions. [2024-11-19 05:05:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 05:05:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:20,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:20,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:05:20,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 227303843, now seen corresponding path program 1 times [2024-11-19 05:05:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187954556] [2024-11-19 05:05:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:05:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:21,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187954556] [2024-11-19 05:05:21,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187954556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:21,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:05:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171407026] [2024-11-19 05:05:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:05:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:05:21,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:05:21,033 INFO L87 Difference]: Start difference. First operand 461 states and 617 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:21,075 INFO L93 Difference]: Finished difference Result 887 states and 1195 transitions. [2024-11-19 05:05:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:05:21,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-19 05:05:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:21,078 INFO L225 Difference]: With dead ends: 887 [2024-11-19 05:05:21,078 INFO L226 Difference]: Without dead ends: 461 [2024-11-19 05:05:21,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:05:21,082 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:21,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:05:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-19 05:05:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-19 05:05:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.3267543859649122) internal successors, (605), 456 states have internal predecessors, (605), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 611 transitions. [2024-11-19 05:05:21,099 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 611 transitions. Word has length 157 [2024-11-19 05:05:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 611 transitions. [2024-11-19 05:05:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 611 transitions. [2024-11-19 05:05:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 05:05:21,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:21,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:05:21,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash 933900449, now seen corresponding path program 1 times [2024-11-19 05:05:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592884959] [2024-11-19 05:05:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:05:21,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592884959] [2024-11-19 05:05:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592884959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:21,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:05:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221723634] [2024-11-19 05:05:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:05:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:05:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:05:21,442 INFO L87 Difference]: Start difference. First operand 461 states and 611 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:21,900 INFO L93 Difference]: Finished difference Result 909 states and 1208 transitions. [2024-11-19 05:05:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:05:21,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-19 05:05:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:21,906 INFO L225 Difference]: With dead ends: 909 [2024-11-19 05:05:21,907 INFO L226 Difference]: Without dead ends: 540 [2024-11-19 05:05:21,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:05:21,909 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 770 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:21,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1017 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:05:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-19 05:05:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 367. [2024-11-19 05:05:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.3176795580110496) internal successors, (477), 362 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 483 transitions. [2024-11-19 05:05:21,929 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 483 transitions. Word has length 157 [2024-11-19 05:05:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:21,930 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 483 transitions. [2024-11-19 05:05:21,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 483 transitions. [2024-11-19 05:05:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 05:05:21,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:21,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:05:21,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1074857037, now seen corresponding path program 1 times [2024-11-19 05:05:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477015079] [2024-11-19 05:05:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:05:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477015079] [2024-11-19 05:05:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477015079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:05:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333957724] [2024-11-19 05:05:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:22,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:22,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:05:22,563 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:05:22,565 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:05:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:22,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 05:05:22,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:05:23,034 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:05:23,062 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:05:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:05:23,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:05:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333957724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:23,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:05:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 05:05:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20621406] [2024-11-19 05:05:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:05:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:05:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:05:23,957 INFO L87 Difference]: Start difference. First operand 367 states and 483 transitions. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:25,325 INFO L93 Difference]: Finished difference Result 861 states and 1146 transitions. [2024-11-19 05:05:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:05:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-19 05:05:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:25,328 INFO L225 Difference]: With dead ends: 861 [2024-11-19 05:05:25,328 INFO L226 Difference]: Without dead ends: 539 [2024-11-19 05:05:25,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 159 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:05:25,330 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 463 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:25,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1972 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 05:05:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-19 05:05:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 367. [2024-11-19 05:05:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.3149171270718232) internal successors, (476), 362 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 482 transitions. [2024-11-19 05:05:25,346 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 482 transitions. Word has length 167 [2024-11-19 05:05:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:25,346 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 482 transitions. [2024-11-19 05:05:25,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 482 transitions. [2024-11-19 05:05:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 05:05:25,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:25,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:25,370 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:05:25,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:25,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:25,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -452928430, now seen corresponding path program 1 times [2024-11-19 05:05:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576665538] [2024-11-19 05:05:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:05:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:26,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576665538] [2024-11-19 05:05:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576665538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:05:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412664538] [2024-11-19 05:05:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:26,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:05:26,341 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:05:26,343 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:05:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:26,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 05:05:26,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:05:26,764 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:05:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:05:27,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:05:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412664538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:05:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2024-11-19 05:05:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738639667] [2024-11-19 05:05:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:27,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:05:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:05:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:05:27,519 INFO L87 Difference]: Start difference. First operand 367 states and 482 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:28,308 INFO L93 Difference]: Finished difference Result 668 states and 879 transitions. [2024-11-19 05:05:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:05:28,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-11-19 05:05:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:28,312 INFO L225 Difference]: With dead ends: 668 [2024-11-19 05:05:28,312 INFO L226 Difference]: Without dead ends: 551 [2024-11-19 05:05:28,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-19 05:05:28,314 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 360 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:28,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1817 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:05:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-19 05:05:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 404. [2024-11-19 05:05:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.2957393483709274) internal successors, (517), 399 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 523 transitions. [2024-11-19 05:05:28,333 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 523 transitions. Word has length 168 [2024-11-19 05:05:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:28,333 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 523 transitions. [2024-11-19 05:05:28,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 523 transitions. [2024-11-19 05:05:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 05:05:28,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:28,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:28,355 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:05:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 05:05:28,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1111494486, now seen corresponding path program 1 times [2024-11-19 05:05:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583832070] [2024-11-19 05:05:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:05:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583832070] [2024-11-19 05:05:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583832070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:05:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588249770] [2024-11-19 05:05:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:29,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:05:29,022 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:05:29,024 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:05:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:29,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-19 05:05:29,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:05:29,659 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:05:29,675 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 7 treesize of output 3 [2024-11-19 05:05:29,678 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:05:29,793 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:05:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:05:30,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:05:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:05:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588249770] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 05:05:32,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 05:05:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 14] total 27 [2024-11-19 05:05:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684816332] [2024-11-19 05:05:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:32,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 05:05:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 05:05:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2024-11-19 05:05:32,781 INFO L87 Difference]: Start difference. First operand 404 states and 523 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:37,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 05:05:43,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 05:05:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:43,074 INFO L93 Difference]: Finished difference Result 601 states and 780 transitions. [2024-11-19 05:05:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 05:05:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2024-11-19 05:05:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:43,078 INFO L225 Difference]: With dead ends: 601 [2024-11-19 05:05:43,078 INFO L226 Difference]: Without dead ends: 484 [2024-11-19 05:05:43,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 05:05:43,080 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 114 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:43,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 3028 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1121 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-11-19 05:05:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-19 05:05:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 415. [2024-11-19 05:05:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2951219512195122) internal successors, (531), 410 states have internal predecessors, (531), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 537 transitions. [2024-11-19 05:05:43,102 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 537 transitions. Word has length 169 [2024-11-19 05:05:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 537 transitions. [2024-11-19 05:05:43,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 537 transitions. [2024-11-19 05:05:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 05:05:43,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:43,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:43,128 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:05:43,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:43,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1134084968, now seen corresponding path program 1 times [2024-11-19 05:05:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:43,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140352399] [2024-11-19 05:05:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:05:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140352399] [2024-11-19 05:05:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140352399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:05:43,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801991109] [2024-11-19 05:05:43,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:05:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:05:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:05:43,527 INFO L87 Difference]: Start difference. First operand 415 states and 537 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:43,583 INFO L93 Difference]: Finished difference Result 547 states and 711 transitions. [2024-11-19 05:05:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:05:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2024-11-19 05:05:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:43,586 INFO L225 Difference]: With dead ends: 547 [2024-11-19 05:05:43,586 INFO L226 Difference]: Without dead ends: 415 [2024-11-19 05:05:43,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:05:43,587 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:43,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 682 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:05:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-19 05:05:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-11-19 05:05:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2804878048780488) internal successors, (525), 410 states have internal predecessors, (525), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 531 transitions. [2024-11-19 05:05:43,609 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 531 transitions. Word has length 169 [2024-11-19 05:05:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:43,609 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 531 transitions. [2024-11-19 05:05:43,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 531 transitions. [2024-11-19 05:05:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 05:05:43,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:43,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:05:43,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:43,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash 225472162, now seen corresponding path program 1 times [2024-11-19 05:05:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563067232] [2024-11-19 05:05:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:05:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563067232] [2024-11-19 05:05:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563067232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:05:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:05:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:05:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224014342] [2024-11-19 05:05:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:05:43,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:05:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:05:43,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:05:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:05:43,816 INFO L87 Difference]: Start difference. First operand 415 states and 531 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:05:43,873 INFO L93 Difference]: Finished difference Result 530 states and 683 transitions. [2024-11-19 05:05:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:05:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2024-11-19 05:05:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:05:43,876 INFO L225 Difference]: With dead ends: 530 [2024-11-19 05:05:43,876 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 05:05:43,877 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:05:43,877 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 9 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:05:43,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 995 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:05:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 05:05:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-19 05:05:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.2838874680306904) internal successors, (502), 391 states have internal predecessors, (502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:05:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 508 transitions. [2024-11-19 05:05:43,898 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 508 transitions. Word has length 169 [2024-11-19 05:05:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:05:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 508 transitions. [2024-11-19 05:05:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:05:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 508 transitions. [2024-11-19 05:05:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-19 05:05:43,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:05:43,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:05:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:05:43,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:05:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:05:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 19646586, now seen corresponding path program 1 times [2024-11-19 05:05:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:05:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655396596] [2024-11-19 05:05:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:05:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:05:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:05:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655396596] [2024-11-19 05:05:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655396596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:05:44,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735044866] [2024-11-19 05:05:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:05:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:05:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:05:44,259 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:05:44,260 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:05:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:05:44,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 05:05:44,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:06:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:06:33,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:06:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735044866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:06:33,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:06:33,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2024-11-19 05:06:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721112852] [2024-11-19 05:06:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:06:33,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 05:06:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:06:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 05:06:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=164, Unknown=13, NotChecked=0, Total=210 [2024-11-19 05:06:33,977 INFO L87 Difference]: Start difference. First operand 396 states and 508 transitions. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:06:38,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 05:06:42,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]