./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:07:14,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:07:14,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:07:14,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:07:14,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:07:14,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:07:14,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:07:14,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:07:14,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:07:14,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:07:14,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:07:14,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:07:14,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:07:14,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:07:14,251 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:07:14,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:07:14,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:07:14,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:07:14,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:07:14,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:07:14,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:07:14,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:07:14,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:07:14,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:07:14,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:07:14,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:07:14,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:07:14,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:07:14,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:07:14,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:07:14,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:07:14,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:07:14,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:07:14,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:07:14,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:07:14,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:07:14,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:07:14,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:07:14,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:07:14,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:07:14,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:07:14,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:07:14,264 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-10-13 09:07:14,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:07:14,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:07:14,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:07:14,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:07:14,559 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:07:14,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-10-13 09:07:16,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:07:16,408 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:07:16,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-10-13 09:07:16,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f99e094f/64e663a4b2194b4dbf49b0b1c31edada/FLAGb151dfc9d [2024-10-13 09:07:16,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f99e094f/64e663a4b2194b4dbf49b0b1c31edada [2024-10-13 09:07:16,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:07:16,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:07:16,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:07:16,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:07:16,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:07:16,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:16" (1/1) ... [2024-10-13 09:07:16,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287ae607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:16, skipping insertion in model container [2024-10-13 09:07:16,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:16" (1/1) ... [2024-10-13 09:07:16,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:07:16,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-10-13 09:07:17,044 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-10-13 09:07:17,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-10-13 09:07:17,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:07:17,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:07:17,093 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-10-13 09:07:17,160 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-10-13 09:07:17,161 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-10-13 09:07:17,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:07:17,206 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:07:17,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17 WrapperNode [2024-10-13 09:07:17,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:07:17,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:07:17,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:07:17,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:07:17,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,411 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-10-13 09:07:17,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:07:17,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:07:17,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:07:17,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:07:17,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,543 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-13 09:07:17,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:07:17,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:07:17,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:07:17,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:07:17,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (1/1) ... [2024-10-13 09:07:17,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:07:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:07:17,717 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-10-13 09:07:17,722 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-10-13 09:07:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:07:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:07:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:07:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:07:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:07:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:07:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:07:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:07:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:07:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:07:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:07:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:07:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:07:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:07:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:07:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:07:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:07:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:07:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:07:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:07:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:07:17,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:07:18,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:07:18,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:07:19,476 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-10-13 09:07:19,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:07:19,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:07:19,526 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 09:07:19,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:19 BoogieIcfgContainer [2024-10-13 09:07:19,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:07:19,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:07:19,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:07:19,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:07:19,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:07:16" (1/3) ... [2024-10-13 09:07:19,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfe0ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:19, skipping insertion in model container [2024-10-13 09:07:19,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:17" (2/3) ... [2024-10-13 09:07:19,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfe0ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:19, skipping insertion in model container [2024-10-13 09:07:19,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:19" (3/3) ... [2024-10-13 09:07:19,537 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-10-13 09:07:19,554 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:07:19,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 09:07:19,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:07:19,642 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;@7292c96b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:07:19,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 09:07:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 384 states have (on average 1.6328125) internal successors, (627), 386 states have internal predecessors, (627), 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-10-13 09:07:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:07:19,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:19,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:19,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1356440670, now seen corresponding path program 1 times [2024-10-13 09:07:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505634762] [2024-10-13 09:07:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505634762] [2024-10-13 09:07:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505634762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:07:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830796619] [2024-10-13 09:07:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:19,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:07:19,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:07:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:07:19,861 INFO L87 Difference]: Start difference. First operand has 391 states, 384 states have (on average 1.6328125) internal successors, (627), 386 states have internal predecessors, (627), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:07:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:19,935 INFO L93 Difference]: Finished difference Result 781 states and 1265 transitions. [2024-10-13 09:07:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:07:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-13 09:07:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:19,953 INFO L225 Difference]: With dead ends: 781 [2024-10-13 09:07:19,953 INFO L226 Difference]: Without dead ends: 389 [2024-10-13 09:07:19,958 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-10-13 09:07:19,961 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:19,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:07:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-13 09:07:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-13 09:07:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 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-10-13 09:07:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2024-10-13 09:07:20,026 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2024-10-13 09:07:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2024-10-13 09:07:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:07:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2024-10-13 09:07:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 09:07:20,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:20,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:20,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:07:20,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:20,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1301144548, now seen corresponding path program 1 times [2024-10-13 09:07:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:20,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438711665] [2024-10-13 09:07:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:20,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438711665] [2024-10-13 09:07:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438711665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:07:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920215189] [2024-10-13 09:07:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:20,235 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:20,439 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2024-10-13 09:07:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:07:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 09:07:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:20,446 INFO L225 Difference]: With dead ends: 963 [2024-10-13 09:07:20,446 INFO L226 Difference]: Without dead ends: 773 [2024-10-13 09:07:20,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-13 09:07:20,448 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 548 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:20,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1705 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-13 09:07:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 391. [2024-10-13 09:07:20,492 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-10-13 09:07:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-10-13 09:07:20,495 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 9 [2024-10-13 09:07:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:20,495 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-10-13 09:07:20,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-10-13 09:07:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 09:07:20,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:20,499 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] [2024-10-13 09:07:20,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:07:20,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1454214717, now seen corresponding path program 1 times [2024-10-13 09:07:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:20,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948570585] [2024-10-13 09:07:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948570585] [2024-10-13 09:07:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948570585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:07:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990910174] [2024-10-13 09:07:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:20,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:20,969 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-10-13 09:07:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:21,080 INFO L93 Difference]: Finished difference Result 782 states and 1128 transitions. [2024-10-13 09:07:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:07:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-10-13 09:07:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:21,084 INFO L225 Difference]: With dead ends: 782 [2024-10-13 09:07:21,084 INFO L226 Difference]: Without dead ends: 394 [2024-10-13 09:07:21,085 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-10-13 09:07:21,087 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 105 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:21,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1505 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-13 09:07:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2024-10-13 09:07:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.431168831168831) internal successors, (551), 386 states have internal predecessors, (551), 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-10-13 09:07:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 557 transitions. [2024-10-13 09:07:21,102 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 557 transitions. Word has length 85 [2024-10-13 09:07:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:21,103 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 557 transitions. [2024-10-13 09:07:21,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-10-13 09:07:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 557 transitions. [2024-10-13 09:07:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 09:07:21,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:21,106 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] [2024-10-13 09:07:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:07:21,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:21,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1209933513, now seen corresponding path program 1 times [2024-10-13 09:07:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193342618] [2024-10-13 09:07:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193342618] [2024-10-13 09:07:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193342618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:07:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885253303] [2024-10-13 09:07:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:07:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:07:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:07:21,414 INFO L87 Difference]: Start difference. First operand 391 states and 557 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-10-13 09:07:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:21,521 INFO L93 Difference]: Finished difference Result 1072 states and 1542 transitions. [2024-10-13 09:07:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:07:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2024-10-13 09:07:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:21,527 INFO L225 Difference]: With dead ends: 1072 [2024-10-13 09:07:21,527 INFO L226 Difference]: Without dead ends: 684 [2024-10-13 09:07:21,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-13 09:07:21,530 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 371 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:21,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1269 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-13 09:07:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 680. [2024-10-13 09:07:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 674 states have (on average 1.4495548961424332) internal successors, (977), 675 states have internal predecessors, (977), 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-10-13 09:07:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 983 transitions. [2024-10-13 09:07:21,552 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 983 transitions. Word has length 85 [2024-10-13 09:07:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 983 transitions. [2024-10-13 09:07:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-10-13 09:07:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 983 transitions. [2024-10-13 09:07:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 09:07:21,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:21,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:07:21,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1474708445, now seen corresponding path program 1 times [2024-10-13 09:07:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954673830] [2024-10-13 09:07:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:07:22,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:22,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954673830] [2024-10-13 09:07:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954673830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:22,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:07:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721879066] [2024-10-13 09:07:22,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:07:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:07:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:07:22,058 INFO L87 Difference]: Start difference. First operand 680 states and 983 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-10-13 09:07:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:22,413 INFO L93 Difference]: Finished difference Result 964 states and 1389 transitions. [2024-10-13 09:07:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:07:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 98 [2024-10-13 09:07:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:22,420 INFO L225 Difference]: With dead ends: 964 [2024-10-13 09:07:22,421 INFO L226 Difference]: Without dead ends: 960 [2024-10-13 09:07:22,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:22,424 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 536 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:22,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2168 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-13 09:07:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 682. [2024-10-13 09:07:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 676 states have (on average 1.448224852071006) internal successors, (979), 677 states have internal predecessors, (979), 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-10-13 09:07:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 985 transitions. [2024-10-13 09:07:22,451 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 985 transitions. Word has length 98 [2024-10-13 09:07:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:22,453 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 985 transitions. [2024-10-13 09:07:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-10-13 09:07:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 985 transitions. [2024-10-13 09:07:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:07:22,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:22,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:22,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:07:22,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 415984286, now seen corresponding path program 1 times [2024-10-13 09:07:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000351584] [2024-10-13 09:07:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:07:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000351584] [2024-10-13 09:07:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000351584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:22,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:22,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:07:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108127907] [2024-10-13 09:07:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:07:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:07:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:07:22,862 INFO L87 Difference]: Start difference. First operand 682 states and 985 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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-10-13 09:07:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:23,165 INFO L93 Difference]: Finished difference Result 949 states and 1370 transitions. [2024-10-13 09:07:23,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:07:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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 152 [2024-10-13 09:07:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:23,170 INFO L225 Difference]: With dead ends: 949 [2024-10-13 09:07:23,171 INFO L226 Difference]: Without dead ends: 600 [2024-10-13 09:07:23,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:23,173 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 32 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:23,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1711 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-13 09:07:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2024-10-13 09:07:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.3935810810810811) internal successors, (825), 593 states have internal predecessors, (825), 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-10-13 09:07:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 831 transitions. [2024-10-13 09:07:23,196 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 831 transitions. Word has length 152 [2024-10-13 09:07:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:23,198 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 831 transitions. [2024-10-13 09:07:23,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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-10-13 09:07:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 831 transitions. [2024-10-13 09:07:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:07:23,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:23,202 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:07:23,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -755529838, now seen corresponding path program 1 times [2024-10-13 09:07:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339305724] [2024-10-13 09:07:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339305724] [2024-10-13 09:07:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339305724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:07:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758791770] [2024-10-13 09:07:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:07:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:07:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:23,523 INFO L87 Difference]: Start difference. First operand 598 states and 831 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-10-13 09:07:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:24,068 INFO L93 Difference]: Finished difference Result 1413 states and 1944 transitions. [2024-10-13 09:07:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:07:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 152 [2024-10-13 09:07:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:24,075 INFO L225 Difference]: With dead ends: 1413 [2024-10-13 09:07:24,075 INFO L226 Difference]: Without dead ends: 947 [2024-10-13 09:07:24,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:24,077 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 1265 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:24,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 2367 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-13 09:07:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 737. [2024-10-13 09:07:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 731 states have (on average 1.387140902872777) internal successors, (1014), 732 states have internal predecessors, (1014), 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-10-13 09:07:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2024-10-13 09:07:24,103 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 152 [2024-10-13 09:07:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:24,103 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2024-10-13 09:07:24,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-10-13 09:07:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2024-10-13 09:07:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 09:07:24,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:24,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:24,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:07:24,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:24,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1424447802, now seen corresponding path program 1 times [2024-10-13 09:07:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504933931] [2024-10-13 09:07:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504933931] [2024-10-13 09:07:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504933931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:07:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107604059] [2024-10-13 09:07:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:25,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:07:25,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:07:25,021 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-10-13 09:07:25,023 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-10-13 09:07:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:25,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 09:07:25,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:07:25,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:07:25,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 09:07:25,700 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-10-13 09:07:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:25,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:07:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107604059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:07:25,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:07:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-13 09:07:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878063841] [2024-10-13 09:07:25,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:07:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 09:07:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 09:07:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:07:25,944 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:07:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:26,563 INFO L93 Difference]: Finished difference Result 3140 states and 4313 transitions. [2024-10-13 09:07:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 09:07:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-13 09:07:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:26,577 INFO L225 Difference]: With dead ends: 3140 [2024-10-13 09:07:26,577 INFO L226 Difference]: Without dead ends: 2733 [2024-10-13 09:07:26,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-13 09:07:26,582 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 2402 mSDsluCounter, 3664 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:26,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 4162 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:07:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2024-10-13 09:07:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1167. [2024-10-13 09:07:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1157 states have (on average 1.3915298184961107) internal successors, (1610), 1158 states have internal predecessors, (1610), 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-10-13 09:07:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1622 transitions. [2024-10-13 09:07:26,657 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1622 transitions. Word has length 162 [2024-10-13 09:07:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:26,658 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1622 transitions. [2024-10-13 09:07:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:07:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1622 transitions. [2024-10-13 09:07:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-13 09:07:26,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:26,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:26,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 09:07:26,867 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-10-13 09:07:26,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:26,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -897644595, now seen corresponding path program 1 times [2024-10-13 09:07:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:26,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255945779] [2024-10-13 09:07:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255945779] [2024-10-13 09:07:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255945779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:07:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17383062] [2024-10-13 09:07:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:07:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:07:30,749 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-10-13 09:07:30,750 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-10-13 09:07:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:31,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 09:07:31,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:07:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:07:31,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 09:07:31,803 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-10-13 09:07:31,912 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-10-13 09:07:32,033 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-10-13 09:07:32,039 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-10-13 09:07:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:32,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:07:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17383062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:07:32,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:07:32,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-13 09:07:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267597331] [2024-10-13 09:07:32,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:07:32,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 09:07:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 09:07:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-13 09:07:32,675 INFO L87 Difference]: Start difference. First operand 1167 states and 1622 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:07:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:33,706 INFO L93 Difference]: Finished difference Result 6680 states and 9188 transitions. [2024-10-13 09:07:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 09:07:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-13 09:07:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:33,735 INFO L225 Difference]: With dead ends: 6680 [2024-10-13 09:07:33,735 INFO L226 Difference]: Without dead ends: 6273 [2024-10-13 09:07:33,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-13 09:07:33,743 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 9563 mSDsluCounter, 7239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9583 SdHoareTripleChecker+Valid, 7737 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:33,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9583 Valid, 7737 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:07:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2024-10-13 09:07:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 2283. [2024-10-13 09:07:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2267 states have (on average 1.4009704455227172) internal successors, (3176), 2268 states have internal predecessors, (3176), 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-10-13 09:07:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3200 transitions. [2024-10-13 09:07:33,872 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3200 transitions. Word has length 390 [2024-10-13 09:07:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 3200 transitions. [2024-10-13 09:07:33,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:07:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3200 transitions. [2024-10-13 09:07:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-13 09:07:33,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:33,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:33,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:07:34,097 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-10-13 09:07:34,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:34,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash -654644389, now seen corresponding path program 2 times [2024-10-13 09:07:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:34,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198250955] [2024-10-13 09:07:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:46,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:07:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:07:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:07:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198250955] [2024-10-13 09:07:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198250955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:07:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595144106] [2024-10-13 09:07:46,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 09:07:46,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:07:46,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:07:46,463 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-10-13 09:07:46,464 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-10-13 09:07:47,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 09:07:47,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 09:07:47,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 09:07:47,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:07:47,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:07:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-13 09:07:48,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:07:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595144106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:07:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-10-13 09:07:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025875846] [2024-10-13 09:07:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:48,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:07:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:07:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 09:07:48,057 INFO L87 Difference]: Start difference. First operand 2283 states and 3200 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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-10-13 09:07:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:49,086 INFO L93 Difference]: Finished difference Result 2867 states and 3983 transitions. [2024-10-13 09:07:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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 846 [2024-10-13 09:07:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:49,099 INFO L225 Difference]: With dead ends: 2867 [2024-10-13 09:07:49,099 INFO L226 Difference]: Without dead ends: 2463 [2024-10-13 09:07:49,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 09:07:49,103 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 468 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:49,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 3945 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:07:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2024-10-13 09:07:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2318. [2024-10-13 09:07:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2302 states have (on average 1.396611642050391) internal successors, (3215), 2303 states have internal predecessors, (3215), 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-10-13 09:07:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3239 transitions. [2024-10-13 09:07:49,174 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3239 transitions. Word has length 846 [2024-10-13 09:07:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:49,176 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 3239 transitions. [2024-10-13 09:07:49,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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-10-13 09:07:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3239 transitions. [2024-10-13 09:07:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-13 09:07:49,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:49,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:07:49,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 09:07:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:07:49,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:07:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 73801654, now seen corresponding path program 1 times [2024-10-13 09:07:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551200553] [2024-10-13 09:07:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:08:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:08:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:08:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:08:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:08:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:08:00,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:08:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551200553] [2024-10-13 09:08:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551200553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:08:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555883730] [2024-10-13 09:08:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:08:00,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:08:00,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:08:00,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:08:00,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 09:08:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:08:02,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 09:08:02,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:08:02,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:08:02,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 09:08:02,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-10-13 09:08:02,490 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-10-13 09:08:02,572 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-10-13 09:08:02,656 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-10-13 09:08:02,736 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-10-13 09:08:02,847 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-10-13 09:08:02,931 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-10-13 09:08:03,025 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-10-13 09:08:03,119 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-10-13 09:08:03,125 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-10-13 09:08:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:08:03,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:08:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:08:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555883730] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:08:04,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:08:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 39 [2024-10-13 09:08:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085039859] [2024-10-13 09:08:04,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:08:04,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-13 09:08:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:08:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 09:08:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=910, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 09:08:04,308 INFO L87 Difference]: Start difference. First operand 2318 states and 3239 transitions. Second operand has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:08:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:08:06,693 INFO L93 Difference]: Finished difference Result 13795 states and 18976 transitions. [2024-10-13 09:08:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-13 09:08:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 847 [2024-10-13 09:08:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:08:06,765 INFO L225 Difference]: With dead ends: 13795 [2024-10-13 09:08:06,765 INFO L226 Difference]: Without dead ends: 13353 [2024-10-13 09:08:06,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1738 GetRequests, 1685 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1775, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 09:08:06,775 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 15634 mSDsluCounter, 12440 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15678 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:08:06,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15678 Valid, 12938 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:08:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13353 states. [2024-10-13 09:08:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13353 to 4550. [2024-10-13 09:08:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4522 states have (on average 1.4035824856258292) internal successors, (6347), 4523 states have internal predecessors, (6347), 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-10-13 09:08:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6395 transitions. [2024-10-13 09:08:07,052 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6395 transitions. Word has length 847 [2024-10-13 09:08:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:08:07,054 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 6395 transitions. [2024-10-13 09:08:07,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:08:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6395 transitions. [2024-10-13 09:08:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2024-10-13 09:08:07,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:08:07,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:08:07,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 09:08:07,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:08:07,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:08:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:08:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1418037734, now seen corresponding path program 2 times [2024-10-13 09:08:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:08:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295540869] [2024-10-13 09:08:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:08:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:08:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat