./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_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:25:52,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:25:52,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:25:52,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:25:52,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:25:52,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:25:52,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:25:52,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:25:52,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:25:52,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:25:52,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:25:52,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:25:52,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:25:52,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:25:52,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:25:52,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:25:52,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:25:52,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:25:52,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:25:52,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:25:52,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:25:52,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:25:52,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:25:52,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:25:52,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:25:52,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:25:52,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:25:52,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:25:52,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:25:52,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:25:52,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:25:52,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:25:52,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:25:52,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:25:52,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:25:52,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:25:52,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:25:52,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:25:52,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:25:52,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:25:52,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:25:52,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:25:52,176 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-clean/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-clean/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-11 16:25:52,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:25:52,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:25:52,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:25:52,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:25:52,458 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:25:52,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-10-11 16:25:53,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:25:54,294 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:25:54,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-10-11 16:25:54,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9885b47d/a30fc7525b3a4904ab90229bac290998/FLAG46d8d3e34 [2024-10-11 16:25:54,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9885b47d/a30fc7525b3a4904ab90229bac290998 [2024-10-11 16:25:54,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:25:54,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:25:54,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:25:54,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:25:54,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:25:54,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:54" (1/1) ... [2024-10-11 16:25:54,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b316d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:54, skipping insertion in model container [2024-10-11 16:25:54,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:54" (1/1) ... [2024-10-11 16:25:54,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:25:54,853 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_FNV_nondet_test2-1.i[37435,37448] [2024-10-11 16:25:54,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:25:54,976 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:25:55,023 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_FNV_nondet_test2-1.i[37435,37448] [2024-10-11 16:25:55,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:25:55,151 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:25:55,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55 WrapperNode [2024-10-11 16:25:55,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:25:55,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:25:55,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:25:55,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:25:55,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,252 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1277 [2024-10-11 16:25:55,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:25:55,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:25:55,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:25:55,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:25:55,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,334 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-11 16:25:55,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:25:55,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:25:55,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:25:55,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:25:55,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (1/1) ... [2024-10-11 16:25:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:25:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:55,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:25:55,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:25:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:25:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:25:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:25:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:25:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:25:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:25:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:25:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:25:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:25:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:25:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:25:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:25:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:25:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:25:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:25:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:25:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:25:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:25:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:25:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:25:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:25:55,718 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:25:55,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:25:57,117 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-10-11 16:25:57,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:25:57,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:25:57,204 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 16:25:57,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:57 BoogieIcfgContainer [2024-10-11 16:25:57,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:25:57,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:25:57,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:25:57,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:25:57,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:25:54" (1/3) ... [2024-10-11 16:25:57,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9a895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:57, skipping insertion in model container [2024-10-11 16:25:57,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:55" (2/3) ... [2024-10-11 16:25:57,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9a895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:57, skipping insertion in model container [2024-10-11 16:25:57,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:57" (3/3) ... [2024-10-11 16:25:57,216 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2024-10-11 16:25:57,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:25:57,234 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:25:57,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:25:57,327 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;@59f7f93d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:25:57,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:25:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 356 states have (on average 1.6264044943820224) internal successors, (579), 357 states have internal predecessors, (579), 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-11 16:25:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 16:25:57,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:57,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:57,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 685924647, now seen corresponding path program 1 times [2024-10-11 16:25:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345856728] [2024-10-11 16:25:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:57,555 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-11 16:25:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345856728] [2024-10-11 16:25:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345856728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:25:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725232333] [2024-10-11 16:25:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:57,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:25:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:25:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:25:57,589 INFO L87 Difference]: Start difference. First operand has 362 states, 356 states have (on average 1.6264044943820224) internal successors, (579), 357 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:57,668 INFO L93 Difference]: Finished difference Result 722 states and 1167 transitions. [2024-10-11 16:25:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:25:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 16:25:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:57,687 INFO L225 Difference]: With dead ends: 722 [2024-10-11 16:25:57,687 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 16:25:57,691 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-11 16:25:57,694 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:57,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:25:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 16:25:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-11 16:25:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4576271186440677) internal successors, (516), 354 states have internal predecessors, (516), 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-11 16:25:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 522 transitions. [2024-10-11 16:25:57,766 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 522 transitions. Word has length 10 [2024-10-11 16:25:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:57,767 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 522 transitions. [2024-10-11 16:25:57,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-10-11 16:25:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:25:57,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:57,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:57,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:25:57,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:57,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash -347738900, now seen corresponding path program 1 times [2024-10-11 16:25:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646719979] [2024-10-11 16:25:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:58,184 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-11 16:25:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646719979] [2024-10-11 16:25:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646719979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:58,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:25:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153637152] [2024-10-11 16:25:58,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:58,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:25:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:58,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:25:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:25:58,190 INFO L87 Difference]: Start difference. First operand 359 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-11 16:25:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:58,339 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2024-10-11 16:25:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:25:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-10-11 16:25:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:58,342 INFO L225 Difference]: With dead ends: 475 [2024-10-11 16:25:58,343 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 16:25:58,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:25:58,347 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:58,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1234 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 16:25:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-11 16:25:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4070512820512822) internal successors, (439), 312 states have internal predecessors, (439), 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-11 16:25:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2024-10-11 16:25:58,389 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 65 [2024-10-11 16:25:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2024-10-11 16:25:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-11 16:25:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2024-10-11 16:25:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:25:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:58,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:25:58,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1528203272, now seen corresponding path program 1 times [2024-10-11 16:25:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479634273] [2024-10-11 16:25:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:58,938 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-11 16:25:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:58,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479634273] [2024-10-11 16:25:58,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479634273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:58,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:25:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041126438] [2024-10-11 16:25:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:25:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:25:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:25:58,944 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-11 16:25:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:59,129 INFO L93 Difference]: Finished difference Result 747 states and 1043 transitions. [2024-10-11 16:25:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:25:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2024-10-11 16:25:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:59,133 INFO L225 Difference]: With dead ends: 747 [2024-10-11 16:25:59,133 INFO L226 Difference]: Without dead ends: 628 [2024-10-11 16:25:59,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:25:59,135 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 425 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:59,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 2109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-11 16:25:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 319. [2024-10-11 16:25:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 314 states have internal predecessors, (441), 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-11 16:25:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2024-10-11 16:25:59,156 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 65 [2024-10-11 16:25:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:59,156 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2024-10-11 16:25:59,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-11 16:25:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2024-10-11 16:25:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:25:59,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:59,159 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:59,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:25:59,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:59,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1921741237, now seen corresponding path program 1 times [2024-10-11 16:25:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401732144] [2024-10-11 16:25:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:59,473 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-11 16:25:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401732144] [2024-10-11 16:25:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401732144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:25:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011564864] [2024-10-11 16:25:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:59,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:25:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:25:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:25:59,476 INFO L87 Difference]: Start difference. First operand 319 states and 447 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11 16:25:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:59,560 INFO L93 Difference]: Finished difference Result 592 states and 824 transitions. [2024-10-11 16:25:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:25:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2024-10-11 16:25:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:59,562 INFO L225 Difference]: With dead ends: 592 [2024-10-11 16:25:59,563 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 16:25:59,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:25:59,564 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:59,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 985 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 16:25:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-11 16:25:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.338235294117647) internal successors, (364), 272 states have internal predecessors, (364), 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-11 16:25:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 370 transitions. [2024-10-11 16:25:59,574 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 370 transitions. Word has length 141 [2024-10-11 16:25:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 370 transitions. [2024-10-11 16:25:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11 16:25:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 370 transitions. [2024-10-11 16:25:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:25:59,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:59,576 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:59,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:25:59,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash 891918889, now seen corresponding path program 1 times [2024-10-11 16:25:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:59,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874259671] [2024-10-11 16:25:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:59,779 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-11 16:25:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874259671] [2024-10-11 16:25:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874259671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:25:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290197727] [2024-10-11 16:25:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:25:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:25:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:25:59,782 INFO L87 Difference]: Start difference. First operand 277 states and 370 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-11 16:25:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:59,867 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2024-10-11 16:25:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:25:59,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 141 [2024-10-11 16:25:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:59,870 INFO L225 Difference]: With dead ends: 732 [2024-10-11 16:25:59,871 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:25:59,872 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-11 16:25:59,873 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 177 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:59,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 802 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:25:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-11 16:25:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.342920353982301) internal successors, (607), 452 states have internal predecessors, (607), 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-11 16:25:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2024-10-11 16:25:59,892 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2024-10-11 16:25:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:59,893 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2024-10-11 16:25:59,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-11 16:25:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2024-10-11 16:25:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:25:59,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:59,896 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] [2024-10-11 16:25:59,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:25:59,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:59,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1987483736, now seen corresponding path program 1 times [2024-10-11 16:25:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:59,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104183618] [2024-10-11 16:25:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:26:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:26:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,245 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-11 16:26:00,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104183618] [2024-10-11 16:26:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104183618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:26:00,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:26:00,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:26:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738867531] [2024-10-11 16:26:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:26:00,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:26:00,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:26:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:26:00,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:26:00,250 INFO L87 Difference]: Start difference. First operand 457 states and 613 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:00,468 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2024-10-11 16:26:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:26:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:26:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:00,474 INFO L225 Difference]: With dead ends: 882 [2024-10-11 16:26:00,474 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:26:00,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:26:00,477 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 3 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:00,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 967 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:26:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:26:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-10-11 16:26:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.329646017699115) internal successors, (601), 452 states have internal predecessors, (601), 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-11 16:26:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 607 transitions. [2024-10-11 16:26:00,494 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 607 transitions. Word has length 154 [2024-10-11 16:26:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:00,494 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 607 transitions. [2024-10-11 16:26:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2024-10-11 16:26:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:26:00,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:00,497 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] [2024-10-11 16:26:00,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:26:00,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1445649958, now seen corresponding path program 1 times [2024-10-11 16:26:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750303701] [2024-10-11 16:26:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:26:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:26:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:00,819 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-11 16:26:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750303701] [2024-10-11 16:26:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750303701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:26:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:26:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:26:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734062983] [2024-10-11 16:26:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:26:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:26:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:26:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:26:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:26:00,822 INFO L87 Difference]: Start difference. First operand 457 states and 607 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:01,248 INFO L93 Difference]: Finished difference Result 904 states and 1207 transitions. [2024-10-11 16:26:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:26:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:26:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:01,251 INFO L225 Difference]: With dead ends: 904 [2024-10-11 16:26:01,251 INFO L226 Difference]: Without dead ends: 538 [2024-10-11 16:26:01,252 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-11 16:26:01,253 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 916 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:01,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1249 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:26:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-11 16:26:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 364. [2024-10-11 16:26:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 359 states have (on average 1.3203342618384402) internal successors, (474), 359 states have internal predecessors, (474), 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-11 16:26:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2024-10-11 16:26:01,266 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 154 [2024-10-11 16:26:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:01,267 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2024-10-11 16:26:01,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2024-10-11 16:26:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 16:26:01,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:01,269 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, 1, 1] [2024-10-11 16:26:01,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:26:01,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 640569234, now seen corresponding path program 1 times [2024-10-11 16:26:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475495399] [2024-10-11 16:26:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:26:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:26:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:26:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475495399] [2024-10-11 16:26:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475495399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:26:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095379647] [2024-10-11 16:26:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:01,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:01,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:26:01,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:26:01,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:26:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:02,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 16:26:02,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:26:02,400 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-11 16:26:02,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 16:26:03,474 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-11 16:26:03,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:26:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095379647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:26:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:26:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:26:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420429083] [2024-10-11 16:26:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:26:03,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:26:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:26:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:26:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:26:03,477 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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-11 16:26:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:05,290 INFO L93 Difference]: Finished difference Result 855 states and 1140 transitions. [2024-10-11 16:26:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:26:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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 164 [2024-10-11 16:26:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:05,294 INFO L225 Difference]: With dead ends: 855 [2024-10-11 16:26:05,294 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 16:26:05,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:26:05,299 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 450 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:05,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 2646 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 16:26:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 16:26:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 364. [2024-10-11 16:26:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 359 states have (on average 1.317548746518106) internal successors, (473), 359 states have internal predecessors, (473), 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-11 16:26:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2024-10-11 16:26:05,316 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 164 [2024-10-11 16:26:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:05,317 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2024-10-11 16:26:05,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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-11 16:26:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2024-10-11 16:26:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 16:26:05,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:05,319 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, 1, 1, 1] [2024-10-11 16:26:05,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:26:05,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:05,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:05,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash 565142389, now seen corresponding path program 1 times [2024-10-11 16:26:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632153753] [2024-10-11 16:26:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:26:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:26:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:26:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632153753] [2024-10-11 16:26:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632153753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:26:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108737253] [2024-10-11 16:26:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:26:06,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:26:06,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:26:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:06,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 16:26:06,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:26:06,526 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-11 16:26:07,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:26:07,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-10-11 16:26:07,255 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-11 16:26:07,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:26:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108737253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:26:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:26:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 16:26:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11848537] [2024-10-11 16:26:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:26:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:26:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:26:07,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:26:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:26:07,259 INFO L87 Difference]: Start difference. First operand 364 states and 479 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-11 16:26:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:08,053 INFO L93 Difference]: Finished difference Result 663 states and 874 transitions. [2024-10-11 16:26:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:26:08,054 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 165 [2024-10-11 16:26:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:08,057 INFO L225 Difference]: With dead ends: 663 [2024-10-11 16:26:08,057 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 16:26:08,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:26:08,058 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 362 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:08,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 2020 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:26:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 16:26:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2024-10-11 16:26:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.297979797979798) internal successors, (514), 396 states have internal predecessors, (514), 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-11 16:26:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 520 transitions. [2024-10-11 16:26:08,077 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 520 transitions. Word has length 165 [2024-10-11 16:26:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:08,078 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 520 transitions. [2024-10-11 16:26:08,078 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-11 16:26:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 520 transitions. [2024-10-11 16:26:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 16:26:08,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:08,080 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, 1, 1, 1, 1] [2024-10-11 16:26:08,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 16:26:08,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:08,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash 383929831, now seen corresponding path program 1 times [2024-10-11 16:26:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219449688] [2024-10-11 16:26:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:26:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:26:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:26:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219449688] [2024-10-11 16:26:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219449688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:26:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115636682] [2024-10-11 16:26:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:08,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:26:08,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:26:08,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:26:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:09,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 16:26:09,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:26:49,650 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 35 DAG size of output: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 16:26:58,347 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 16:27:10,371 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)