./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-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_FNV_test7-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 ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:10:51,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:10:51,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:10:51,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:10:51,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:10:51,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:10:51,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:10:51,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:10:51,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:10:51,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:10:51,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:10:51,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:10:51,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:10:51,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:10:51,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:10:51,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:10:51,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:10:51,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:10:51,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:10:51,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:10:51,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:10:51,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:10:51,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:10:51,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:10:51,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:10:51,239 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:10:51,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:10:51,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:10:51,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:10:51,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:10:51,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:10:51,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:10:51,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:10:51,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:10:51,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:10:51,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:10:51,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:10:51,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:10:51,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:10:51,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:10:51,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:10:51,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:10:51,245 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-11-19 05:10:51,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:10:51,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:10:51,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:10:51,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:10:51,555 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:10:51,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-19 05:10:52,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:10:53,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:10:53,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-19 05:10:53,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d5090d4/e47b2f9ad6e94461ad9efc46d292e168/FLAGdf19f5f21 [2024-11-19 05:10:53,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d5090d4/e47b2f9ad6e94461ad9efc46d292e168 [2024-11-19 05:10:53,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:10:53,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:10:53,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:10:53,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:10:53,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:10:53,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:10:53" (1/1) ... [2024-11-19 05:10:53,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e6cfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:53, skipping insertion in model container [2024-11-19 05:10:53,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:10:53" (1/1) ... [2024-11-19 05:10:53,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:10:53,801 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_FNV_test7-2.i[33021,33034] [2024-11-19 05:10:53,915 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_FNV_test7-2.i[44124,44137] [2024-11-19 05:10:53,916 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_FNV_test7-2.i[44245,44258] [2024-11-19 05:10:53,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:10:53,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:10:53,993 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_FNV_test7-2.i[33021,33034] [2024-11-19 05:10:54,046 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_FNV_test7-2.i[44124,44137] [2024-11-19 05:10:54,047 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_FNV_test7-2.i[44245,44258] [2024-11-19 05:10:54,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:10:54,114 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:10:54,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54 WrapperNode [2024-11-19 05:10:54,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:10:54,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:10:54,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:10:54,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:10:54,124 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:10:54" (1/1) ... [2024-11-19 05:10:54,151 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:10:54" (1/1) ... [2024-11-19 05:10:54,218 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1589 [2024-11-19 05:10:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:10:54,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:10:54,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:10:54,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:10:54,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,366 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-11-19 05:10:54,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:10:54,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:10:54,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:10:54,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:10:54,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (1/1) ... [2024-11-19 05:10:54,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:10:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:10:54,513 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:10:54,525 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:10:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:10:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:10:54,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:10:54,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:10:54,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:10:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:10:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:10:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:10:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:10:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:10:54,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:10:54,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:10:54,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:10:56,531 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2024-11-19 05:10:56,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:10:56,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:10:56,552 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-19 05:10:56,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:10:56 BoogieIcfgContainer [2024-11-19 05:10:56,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:10:56,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:10:56,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:10:56,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:10:56,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:10:53" (1/3) ... [2024-11-19 05:10:56,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be129dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:10:56, skipping insertion in model container [2024-11-19 05:10:56,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:54" (2/3) ... [2024-11-19 05:10:56,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be129dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:10:56, skipping insertion in model container [2024-11-19 05:10:56,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:10:56" (3/3) ... [2024-11-19 05:10:56,563 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2024-11-19 05:10:56,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:10:56,580 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:10:56,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:10:56,660 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;@47003d63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:10:56,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:10:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 424 states have (on average 1.625) internal successors, (689), 426 states have internal predecessors, (689), 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:10:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 05:10:56,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:56,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:56,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash -59717688, now seen corresponding path program 1 times [2024-11-19 05:10:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:56,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412356165] [2024-11-19 05:10:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:56,849 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:10:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412356165] [2024-11-19 05:10:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412356165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:10:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102043597] [2024-11-19 05:10:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:10:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:56,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:10:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:10:56,884 INFO L87 Difference]: Start difference. First operand has 431 states, 424 states have (on average 1.625) internal successors, (689), 426 states have internal predecessors, (689), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:56,968 INFO L93 Difference]: Finished difference Result 859 states and 1387 transitions. [2024-11-19 05:10:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:10:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 05:10:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:56,984 INFO L225 Difference]: With dead ends: 859 [2024-11-19 05:10:56,985 INFO L226 Difference]: Without dead ends: 391 [2024-11-19 05:10:56,991 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:10:56,994 INFO L432 NwaCegarLoop]: 616 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, 616 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:10:56,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:10:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-19 05:10:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-19 05:10:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-11-19 05:10:57,066 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 8 [2024-11-19 05:10:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:57,066 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-11-19 05:10:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-11-19 05:10:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 05:10:57,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:57,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:10:57,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -690874686, now seen corresponding path program 1 times [2024-11-19 05:10:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044185915] [2024-11-19 05:10:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:57,283 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:10:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044185915] [2024-11-19 05:10:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044185915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:10:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725150165] [2024-11-19 05:10:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:57,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:10:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:10:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:10:57,289 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:57,450 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2024-11-19 05:10:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:10:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 05:10:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:57,456 INFO L225 Difference]: With dead ends: 965 [2024-11-19 05:10:57,456 INFO L226 Difference]: Without dead ends: 775 [2024-11-19 05:10:57,458 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:10:57,461 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 548 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:10:57,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1715 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:10:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-19 05:10:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 393. [2024-11-19 05:10:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2024-11-19 05:10:57,508 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 10 [2024-11-19 05:10:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:57,509 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2024-11-19 05:10:57,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2024-11-19 05:10:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:10:57,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:57,518 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:10:57,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1711501341, now seen corresponding path program 1 times [2024-11-19 05:10:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734887915] [2024-11-19 05:10:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:57,944 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:10:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734887915] [2024-11-19 05:10:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734887915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:57,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:10:57,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061247432] [2024-11-19 05:10:57,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:57,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:10:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:10:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:10:57,949 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:58,039 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2024-11-19 05:10:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:10:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 05:10:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:58,041 INFO L225 Difference]: With dead ends: 740 [2024-11-19 05:10:58,041 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 05:10:58,043 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:10:58,045 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:10:58,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:10:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 05:10:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-19 05:10:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.4) internal successors, (483), 346 states have internal predecessors, (483), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-19 05:10:58,075 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 86 [2024-11-19 05:10:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-19 05:10:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-19 05:10:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:10:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:58,079 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:10:58,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782545, now seen corresponding path program 1 times [2024-11-19 05:10:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:58,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652995583] [2024-11-19 05:10:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:58,311 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:10:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652995583] [2024-11-19 05:10:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652995583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:10:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171445392] [2024-11-19 05:10:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:10:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:10:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:10:58,316 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:58,415 INFO L93 Difference]: Finished difference Result 952 states and 1337 transitions. [2024-11-19 05:10:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:10:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 05:10:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:58,419 INFO L225 Difference]: With dead ends: 952 [2024-11-19 05:10:58,420 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 05:10:58,421 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:10:58,423 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 298 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:10:58,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1126 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:10:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 05:10:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 598. [2024-11-19 05:10:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-11-19 05:10:58,443 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 86 [2024-11-19 05:10:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-11-19 05:10:58,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:10:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-11-19 05:10:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 05:10:58,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:58,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:10:58,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:58,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1660680967, now seen corresponding path program 1 times [2024-11-19 05:10:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285630014] [2024-11-19 05:10:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:58,851 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:10:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285630014] [2024-11-19 05:10:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285630014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:10:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507275234] [2024-11-19 05:10:58,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:58,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:10:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:10:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:10:58,857 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:10:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:58,961 INFO L93 Difference]: Finished difference Result 880 states and 1243 transitions. [2024-11-19 05:10:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:10:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-19 05:10:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:58,966 INFO L225 Difference]: With dead ends: 880 [2024-11-19 05:10:58,966 INFO L226 Difference]: Without dead ends: 876 [2024-11-19 05:10:58,967 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:10:58,968 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 458 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:10:58,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1380 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:10:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-19 05:10:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 600. [2024-11-19 05:10:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 595 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 847 transitions. [2024-11-19 05:10:58,987 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 847 transitions. Word has length 101 [2024-11-19 05:10:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:58,988 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 847 transitions. [2024-11-19 05:10:58,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:10:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 847 transitions. [2024-11-19 05:10:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:10:58,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:58,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:58,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:10:58,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash -219685304, now seen corresponding path program 1 times [2024-11-19 05:10:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012845658] [2024-11-19 05:10:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:59,328 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:10:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012845658] [2024-11-19 05:10:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012845658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:59,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:10:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726995036] [2024-11-19 05:10:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:10:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:10:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:10:59,335 INFO L87 Difference]: Start difference. First operand 600 states and 847 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:10:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:10:59,424 INFO L93 Difference]: Finished difference Result 865 states and 1227 transitions. [2024-11-19 05:10:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:10:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:10:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:10:59,429 INFO L225 Difference]: With dead ends: 865 [2024-11-19 05:10:59,429 INFO L226 Difference]: Without dead ends: 516 [2024-11-19 05:10:59,430 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:10:59,430 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 30 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:10:59,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1118 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:10:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-19 05:10:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-11-19 05:10:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.3470588235294119) internal successors, (687), 511 states have internal predecessors, (687), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:10:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2024-11-19 05:10:59,446 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 155 [2024-11-19 05:10:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:10:59,447 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2024-11-19 05:10:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:10:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-19 05:10:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:10:59,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:10:59,451 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:10:59,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:10:59,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:10:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:10:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1391199428, now seen corresponding path program 1 times [2024-11-19 05:10:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:10:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126847411] [2024-11-19 05:10:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:10:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:10:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:10:59,769 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:10:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:10:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126847411] [2024-11-19 05:10:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126847411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:10:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:10:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:10:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689828990] [2024-11-19 05:10:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:10:59,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:10:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:10:59,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:10:59,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:10:59,774 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:00,090 INFO L93 Difference]: Finished difference Result 1288 states and 1731 transitions. [2024-11-19 05:11:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:11:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:11:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:00,095 INFO L225 Difference]: With dead ends: 1288 [2024-11-19 05:11:00,095 INFO L226 Difference]: Without dead ends: 863 [2024-11-19 05:11:00,096 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:11:00,097 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 1341 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:00,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1106 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:11:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-19 05:11:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 655. [2024-11-19 05:11:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 649 states have (on average 1.349768875192604) internal successors, (876), 650 states have internal predecessors, (876), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 05:11:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2024-11-19 05:11:00,122 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 155 [2024-11-19 05:11:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2024-11-19 05:11:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2024-11-19 05:11:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:11:00,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:00,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:00,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:11:00,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 778046960, now seen corresponding path program 1 times [2024-11-19 05:11:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208038226] [2024-11-19 05:11:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:01,046 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:11:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208038226] [2024-11-19 05:11:01,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208038226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:11:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414521046] [2024-11-19 05:11:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:01,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:11:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:11:01,050 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:11:01,052 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:11:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:01,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 05:11:01,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:11:01,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:11:01,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:01,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:11:01,795 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:11:01,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:11:02,001 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:11:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414521046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:11:02,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:11:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:11:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230091142] [2024-11-19 05:11:02,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:11:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:11:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:11:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:11:02,005 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:02,329 INFO L93 Difference]: Finished difference Result 2929 states and 3955 transitions. [2024-11-19 05:11:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:11:02,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 165 [2024-11-19 05:11:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:02,342 INFO L225 Difference]: With dead ends: 2929 [2024-11-19 05:11:02,342 INFO L226 Difference]: Without dead ends: 2522 [2024-11-19 05:11:02,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:11:02,345 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 2330 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2336 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:02,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2336 Valid, 3907 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:11:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-19 05:11:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1002. [2024-11-19 05:11:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 992 states have (on average 1.34375) internal successors, (1333), 993 states have internal predecessors, (1333), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 05:11:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1345 transitions. [2024-11-19 05:11:02,400 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1345 transitions. Word has length 165 [2024-11-19 05:11:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1345 transitions. [2024-11-19 05:11:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1345 transitions. [2024-11-19 05:11:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:11:02,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:02,407 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:02,429 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:11:02,611 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:11:02,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:02,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1412739575, now seen corresponding path program 1 times [2024-11-19 05:11:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048508991] [2024-11-19 05:11:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048508991] [2024-11-19 05:11:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048508991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:11:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738625770] [2024-11-19 05:11:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:06,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:11:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:11:06,589 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:11:06,591 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:11:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:07,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 05:11:07,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:11:07,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:11:07,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:07,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:07,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:07,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:07,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:11:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:07,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:11:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738625770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:11:08,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:11:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-19 05:11:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480342361] [2024-11-19 05:11:08,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:11:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 05:11:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:08,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 05:11:08,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2024-11-19 05:11:08,451 INFO L87 Difference]: Start difference. First operand 1002 states and 1345 transitions. Second operand has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:09,156 INFO L93 Difference]: Finished difference Result 6217 states and 8404 transitions. [2024-11-19 05:11:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:11:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 393 [2024-11-19 05:11:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:09,181 INFO L225 Difference]: With dead ends: 6217 [2024-11-19 05:11:09,181 INFO L226 Difference]: Without dead ends: 5810 [2024-11-19 05:11:09,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:11:09,187 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 5576 mSDsluCounter, 5595 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5588 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:09,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5588 Valid, 6022 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:11:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2024-11-19 05:11:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 1866. [2024-11-19 05:11:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1850 states have (on average 1.34) internal successors, (2479), 1851 states have internal predecessors, (2479), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:11:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2503 transitions. [2024-11-19 05:11:09,352 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2503 transitions. Word has length 393 [2024-11-19 05:11:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:09,352 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2503 transitions. [2024-11-19 05:11:09,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2503 transitions. [2024-11-19 05:11:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:11:09,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:09,371 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:09,396 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:11:09,575 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:11:09,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:09,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 301957, now seen corresponding path program 2 times [2024-11-19 05:11:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531892319] [2024-11-19 05:11:09,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:11:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:09,887 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:11:09,889 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:11:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:11:10,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:10,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531892319] [2024-11-19 05:11:10,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531892319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:11:10,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:11:10,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:11:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165445615] [2024-11-19 05:11:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:11:10,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:11:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:11:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:11:10,222 INFO L87 Difference]: Start difference. First operand 1866 states and 2503 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:10,608 INFO L93 Difference]: Finished difference Result 2303 states and 3093 transitions. [2024-11-19 05:11:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:11:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2024-11-19 05:11:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:10,617 INFO L225 Difference]: With dead ends: 2303 [2024-11-19 05:11:10,618 INFO L226 Difference]: Without dead ends: 1899 [2024-11-19 05:11:10,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:11:10,620 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 21 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:10,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1643 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:11:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-19 05:11:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1878. [2024-11-19 05:11:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1862 states have (on average 1.3378088077336197) internal successors, (2491), 1863 states have internal predecessors, (2491), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:11:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2515 transitions. [2024-11-19 05:11:10,747 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2515 transitions. Word has length 849 [2024-11-19 05:11:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2515 transitions. [2024-11-19 05:11:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2515 transitions. [2024-11-19 05:11:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:11:10,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:10,774 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:11:10,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 860122168, now seen corresponding path program 1 times [2024-11-19 05:11:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907677751] [2024-11-19 05:11:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:11:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907677751] [2024-11-19 05:11:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907677751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:11:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:11:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:11:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603422117] [2024-11-19 05:11:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:11:13,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:11:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:11:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:11:13,758 INFO L87 Difference]: Start difference. First operand 1878 states and 2515 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:14,225 INFO L93 Difference]: Finished difference Result 2339 states and 3135 transitions. [2024-11-19 05:11:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:11:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2024-11-19 05:11:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:14,284 INFO L225 Difference]: With dead ends: 2339 [2024-11-19 05:11:14,284 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:11:14,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:11:14,286 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 24 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:14,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2260 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:11:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:11:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1890. [2024-11-19 05:11:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1874 states have (on average 1.3372465314834578) internal successors, (2506), 1875 states have internal predecessors, (2506), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:11:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2530 transitions. [2024-11-19 05:11:14,350 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2530 transitions. Word has length 850 [2024-11-19 05:11:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2530 transitions. [2024-11-19 05:11:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2530 transitions. [2024-11-19 05:11:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:11:14,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:14,362 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:14,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:11:14,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1319136175, now seen corresponding path program 1 times [2024-11-19 05:11:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527173098] [2024-11-19 05:11:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:11:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527173098] [2024-11-19 05:11:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527173098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:11:17,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:11:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:11:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126873583] [2024-11-19 05:11:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:11:17,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:11:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:11:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:11:17,691 INFO L87 Difference]: Start difference. First operand 1890 states and 2530 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:18,299 INFO L93 Difference]: Finished difference Result 2351 states and 3156 transitions. [2024-11-19 05:11:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:11:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:11:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:18,310 INFO L225 Difference]: With dead ends: 2351 [2024-11-19 05:11:18,310 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:11:18,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:11:18,314 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 32 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:18,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2659 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:11:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:11:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1914. [2024-11-19 05:11:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1898 states have (on average 1.3361433087460484) internal successors, (2536), 1899 states have internal predecessors, (2536), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:11:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2560 transitions. [2024-11-19 05:11:18,408 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2560 transitions. Word has length 851 [2024-11-19 05:11:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2560 transitions. [2024-11-19 05:11:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2560 transitions. [2024-11-19 05:11:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:11:18,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:18,424 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:11:18,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1094412118, now seen corresponding path program 1 times [2024-11-19 05:11:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908817751] [2024-11-19 05:11:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:11:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908817751] [2024-11-19 05:11:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908817751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:11:21,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:11:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:11:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859047616] [2024-11-19 05:11:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:11:21,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:11:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:11:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:11:21,140 INFO L87 Difference]: Start difference. First operand 1914 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:21,469 INFO L93 Difference]: Finished difference Result 2393 states and 3198 transitions. [2024-11-19 05:11:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:11:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:11:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:21,480 INFO L225 Difference]: With dead ends: 2393 [2024-11-19 05:11:21,481 INFO L226 Difference]: Without dead ends: 1941 [2024-11-19 05:11:21,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:11:21,484 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 15 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:21,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1950 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:11:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2024-11-19 05:11:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1923. [2024-11-19 05:11:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1907 states have (on average 1.3345568956476141) internal successors, (2545), 1908 states have internal predecessors, (2545), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 05:11:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2569 transitions. [2024-11-19 05:11:21,554 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2569 transitions. Word has length 851 [2024-11-19 05:11:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2569 transitions. [2024-11-19 05:11:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2569 transitions. [2024-11-19 05:11:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:11:21,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:21,564 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:11:21,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1315491067, now seen corresponding path program 1 times [2024-11-19 05:11:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390369173] [2024-11-19 05:11:21,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390369173] [2024-11-19 05:11:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390369173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:11:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41666659] [2024-11-19 05:11:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:11:32,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:11:32,655 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:11:32,657 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:11:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:11:34,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 4158 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 05:11:34,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:11:34,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:11:34,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:34,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:34,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:34,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:35,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:35,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:35,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:11:35,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:11:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:35,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:11:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:11:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41666659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:11:36,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:11:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2024-11-19 05:11:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234700984] [2024-11-19 05:11:36,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:11:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 05:11:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 05:11:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 05:11:36,529 INFO L87 Difference]: Start difference. First operand 1923 states and 2569 transitions. Second operand has 38 states, 38 states have (on average 43.078947368421055) internal successors, (1637), 38 states have internal predecessors, (1637), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:38,513 INFO L93 Difference]: Finished difference Result 14123 states and 18842 transitions. [2024-11-19 05:11:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 05:11:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.078947368421055) internal successors, (1637), 38 states have internal predecessors, (1637), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 852 [2024-11-19 05:11:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:38,565 INFO L225 Difference]: With dead ends: 14123 [2024-11-19 05:11:38,565 INFO L226 Difference]: Without dead ends: 13659 [2024-11-19 05:11:38,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1743 GetRequests, 1692 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=872, Invalid=1578, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 05:11:38,576 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 15394 mSDsluCounter, 10055 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15418 SdHoareTripleChecker+Valid, 10481 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:38,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15418 Valid, 10481 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:11:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2024-11-19 05:11:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 3651. [2024-11-19 05:11:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3623 states have (on average 1.33508142423406) internal successors, (4837), 3624 states have internal predecessors, (4837), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 05:11:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4885 transitions. [2024-11-19 05:11:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4885 transitions. Word has length 852 [2024-11-19 05:11:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:38,771 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4885 transitions. [2024-11-19 05:11:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 43.078947368421055) internal successors, (1637), 38 states have internal predecessors, (1637), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:11:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4885 transitions. [2024-11-19 05:11:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:11:38,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:38,796 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:38,828 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:11:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:11:38,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:38,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 267357791, now seen corresponding path program 2 times [2024-11-19 05:11:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444453773] [2024-11-19 05:11:38,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:11:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:39,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:11:39,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:11:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17562 trivial. 0 not checked. [2024-11-19 05:11:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:11:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444453773] [2024-11-19 05:11:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444453773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:11:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:11:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:11:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697544937] [2024-11-19 05:11:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:11:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:11:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:11:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:11:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:11:39,818 INFO L87 Difference]: Start difference. First operand 3651 states and 4885 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:11:40,211 INFO L93 Difference]: Finished difference Result 4311 states and 5753 transitions. [2024-11-19 05:11:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:11:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1764 [2024-11-19 05:11:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:11:40,226 INFO L225 Difference]: With dead ends: 4311 [2024-11-19 05:11:40,226 INFO L226 Difference]: Without dead ends: 3850 [2024-11-19 05:11:40,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:11:40,230 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 434 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:11:40,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2230 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:11:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2024-11-19 05:11:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3686. [2024-11-19 05:11:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3658 states have (on average 1.3329688354291962) internal successors, (4876), 3659 states have internal predecessors, (4876), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 05:11:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4924 transitions. [2024-11-19 05:11:40,342 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4924 transitions. Word has length 1764 [2024-11-19 05:11:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:11:40,345 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4924 transitions. [2024-11-19 05:11:40,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:11:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4924 transitions. [2024-11-19 05:11:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:11:40,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:11:40,369 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:11:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:11:40,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:11:40,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:11:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -513763405, now seen corresponding path program 1 times [2024-11-19 05:11:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:11:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087931887] [2024-11-19 05:11:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:11:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:11:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat