./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_OAT_test3-2.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_OAT_test3-2.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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:34:12,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:34:12,508 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:34:12,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:34:12,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:34:12,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:34:12,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:34:12,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:34:12,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:34:12,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:34:12,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:34:12,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:34:12,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:34:12,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:34:12,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:34:12,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:34:12,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:34:12,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:34:12,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:34:12,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:34:12,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:34:12,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:34:12,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:34:12,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:34:12,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:34:12,551 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:34:12,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:34:12,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:34:12,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:34:12,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:34:12,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:34:12,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:34:12,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:34:12,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:34:12,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:34:12,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:34:12,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:34:12,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:34:12,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:34:12,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:34:12,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:34:12,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:34:12,557 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2024-10-11 16:34:12,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:34:12,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:34:12,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:34:12,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:34:12,760 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:34:12,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-10-11 16:34:14,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:34:14,311 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:34:14,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-10-11 16:34:14,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36c6096c6/0e548964917b4a779f7c03150e7d9014/FLAGa3307dba9 [2024-10-11 16:34:14,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36c6096c6/0e548964917b4a779f7c03150e7d9014 [2024-10-11 16:34:14,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:34:14,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:34:14,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:34:14,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:34:14,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:34:14,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:14" (1/1) ... [2024-10-11 16:34:14,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46962f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:14, skipping insertion in model container [2024-10-11 16:34:14,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:14" (1/1) ... [2024-10-11 16:34:14,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:34:14,764 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_OAT_test3-2.i[33021,33034] [2024-10-11 16:34:14,930 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_OAT_test3-2.i[44590,44603] [2024-10-11 16:34:14,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:34:14,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:34:14,977 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_OAT_test3-2.i[33021,33034] [2024-10-11 16:34:15,029 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_OAT_test3-2.i[44590,44603] [2024-10-11 16:34:15,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:34:15,079 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:34:15,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15 WrapperNode [2024-10-11 16:34:15,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:34:15,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:34:15,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:34:15,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:34:15,088 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:34:15" (1/1) ... [2024-10-11 16:34:15,120 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:34:15" (1/1) ... [2024-10-11 16:34:15,174 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1621 [2024-10-11 16:34:15,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:34:15,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:34:15,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:34:15,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:34:15,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,257 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 34, 267]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-10-11 16:34:15,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:34:15,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:34:15,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:34:15,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:34:15,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (1/1) ... [2024-10-11 16:34:15,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:34:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:15,345 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:34:15,347 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:34:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:34:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:34:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:34:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:34:15,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:34:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:34:15,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:34:15,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:34:15,380 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:34:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:34:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:34:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:34:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:34:15,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:34:15,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:34:16,743 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2024-10-11 16:34:16,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:34:16,778 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:34:16,779 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 16:34:16,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:16 BoogieIcfgContainer [2024-10-11 16:34:16,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:34:16,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:34:16,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:34:16,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:34:16,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:34:14" (1/3) ... [2024-10-11 16:34:16,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398fcf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:16, skipping insertion in model container [2024-10-11 16:34:16,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:15" (2/3) ... [2024-10-11 16:34:16,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398fcf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:16, skipping insertion in model container [2024-10-11 16:34:16,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:16" (3/3) ... [2024-10-11 16:34:16,790 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2024-10-11 16:34:16,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:34:16,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:34:16,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:34:16,888 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;@2bc63755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:34:16,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:34:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 427 states have (on average 1.6346604215456675) internal successors, (698), 434 states have internal predecessors, (698), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:34:16,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:16,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:16,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 751559642, now seen corresponding path program 1 times [2024-10-11 16:34:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945893143] [2024-10-11 16:34:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:17,038 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:34:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945893143] [2024-10-11 16:34:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945893143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:34:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008288208] [2024-10-11 16:34:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:17,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:34:17,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:34:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:34:17,065 INFO L87 Difference]: Start difference. First operand has 440 states, 427 states have (on average 1.6346604215456675) internal successors, (698), 434 states have internal predecessors, (698), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:17,145 INFO L93 Difference]: Finished difference Result 879 states and 1432 transitions. [2024-10-11 16:34:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:34:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 16:34:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:17,157 INFO L225 Difference]: With dead ends: 879 [2024-10-11 16:34:17,157 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 16:34:17,161 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:34:17,164 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:17,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:34:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 16:34:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-10-11 16:34:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2024-10-11 16:34:17,213 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 8 [2024-10-11 16:34:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:17,213 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2024-10-11 16:34:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2024-10-11 16:34:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 16:34:17,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:17,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:34:17,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1721610290, now seen corresponding path program 1 times [2024-10-11 16:34:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:17,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430902106] [2024-10-11 16:34:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:17,359 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:34:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430902106] [2024-10-11 16:34:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430902106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:34:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139147145] [2024-10-11 16:34:17,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:17,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:34:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:34:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:17,362 INFO L87 Difference]: Start difference. First operand 404 states and 587 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:17,492 INFO L93 Difference]: Finished difference Result 1002 states and 1464 transitions. [2024-10-11 16:34:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:34:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 16:34:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:17,497 INFO L225 Difference]: With dead ends: 1002 [2024-10-11 16:34:17,497 INFO L226 Difference]: Without dead ends: 797 [2024-10-11 16:34:17,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:17,499 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 558 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:17,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1688 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:34:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-11 16:34:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 406. [2024-10-11 16:34:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2024-10-11 16:34:17,524 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 13 [2024-10-11 16:34:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2024-10-11 16:34:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2024-10-11 16:34:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 16:34:17,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:17,528 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] [2024-10-11 16:34:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:34:17,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1866578605, now seen corresponding path program 1 times [2024-10-11 16:34:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044962490] [2024-10-11 16:34:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:17,882 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:34:17,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044962490] [2024-10-11 16:34:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044962490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:17,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:34:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567461517] [2024-10-11 16:34:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:34:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:17,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:34:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:17,884 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:17,972 INFO L93 Difference]: Finished difference Result 767 states and 1109 transitions. [2024-10-11 16:34:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:34:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 16:34:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:17,974 INFO L225 Difference]: With dead ends: 767 [2024-10-11 16:34:17,974 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 16:34:17,974 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:34:17,975 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 30 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1429 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:34:17,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1429 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:34:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 16:34:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-11 16:34:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 352 states have (on average 1.4090909090909092) internal successors, (496), 358 states have internal predecessors, (496), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 512 transitions. [2024-10-11 16:34:17,987 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 512 transitions. Word has length 89 [2024-10-11 16:34:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:17,987 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 512 transitions. [2024-10-11 16:34:17,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 512 transitions. [2024-10-11 16:34:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 16:34:17,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:17,990 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] [2024-10-11 16:34:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:34:17,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:17,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1058779103, now seen corresponding path program 1 times [2024-10-11 16:34:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:17,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944420369] [2024-10-11 16:34:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,126 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:34:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944420369] [2024-10-11 16:34:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944420369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:34:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747337462] [2024-10-11 16:34:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:18,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:34:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:34:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:34:18,130 INFO L87 Difference]: Start difference. First operand 364 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:18,234 INFO L93 Difference]: Finished difference Result 988 states and 1404 transitions. [2024-10-11 16:34:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:34:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 16:34:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:18,237 INFO L225 Difference]: With dead ends: 988 [2024-10-11 16:34:18,237 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 16:34:18,238 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:34:18,242 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 308 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:18,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1188 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:34:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 16:34:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 611. [2024-10-11 16:34:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 599 states have (on average 1.4223706176961604) internal successors, (852), 605 states have internal predecessors, (852), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 868 transitions. [2024-10-11 16:34:18,258 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 868 transitions. Word has length 89 [2024-10-11 16:34:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:18,258 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 868 transitions. [2024-10-11 16:34:18,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 868 transitions. [2024-10-11 16:34:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 16:34:18,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:18,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:18,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:34:18,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:18,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1238474065, now seen corresponding path program 1 times [2024-10-11 16:34:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428319988] [2024-10-11 16:34:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:34:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:34:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,620 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:34:18,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428319988] [2024-10-11 16:34:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428319988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:18,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850185479] [2024-10-11 16:34:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:18,627 INFO L87 Difference]: Start difference. First operand 611 states and 868 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:18,941 INFO L93 Difference]: Finished difference Result 910 states and 1299 transitions. [2024-10-11 16:34:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:34:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-11 16:34:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:18,945 INFO L225 Difference]: With dead ends: 910 [2024-10-11 16:34:18,946 INFO L226 Difference]: Without dead ends: 891 [2024-10-11 16:34:18,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:18,947 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 465 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:18,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1809 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:34:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-10-11 16:34:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 613. [2024-10-11 16:34:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 601 states have (on average 1.420965058236273) internal successors, (854), 607 states have internal predecessors, (854), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 870 transitions. [2024-10-11 16:34:18,961 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 870 transitions. Word has length 102 [2024-10-11 16:34:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 870 transitions. [2024-10-11 16:34:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 870 transitions. [2024-10-11 16:34:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:34:18,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:18,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:18,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:34:18,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 535773823, now seen corresponding path program 1 times [2024-10-11 16:34:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716179119] [2024-10-11 16:34:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:34:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:34:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,182 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:34:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716179119] [2024-10-11 16:34:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716179119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:19,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:19,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290575420] [2024-10-11 16:34:19,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:19,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:19,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:19,187 INFO L87 Difference]: Start difference. First operand 613 states and 870 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:19,421 INFO L93 Difference]: Finished difference Result 895 states and 1280 transitions. [2024-10-11 16:34:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-11 16:34:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:19,424 INFO L225 Difference]: With dead ends: 895 [2024-10-11 16:34:19,425 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 16:34:19,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:19,427 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 37 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:19,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1463 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:34:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 16:34:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2024-10-11 16:34:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 517 states have (on average 1.3539651837524178) internal successors, (700), 523 states have internal predecessors, (700), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2024-10-11 16:34:19,442 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 152 [2024-10-11 16:34:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:19,443 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2024-10-11 16:34:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2024-10-11 16:34:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:34:19,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:19,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:19,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:34:19,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:19,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -635740301, now seen corresponding path program 1 times [2024-10-11 16:34:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189499642] [2024-10-11 16:34:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:34:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:34:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:19,746 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:34:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:19,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189499642] [2024-10-11 16:34:19,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189499642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:19,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:19,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:34:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713967897] [2024-10-11 16:34:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:19,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:34:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:19,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:34:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:19,749 INFO L87 Difference]: Start difference. First operand 529 states and 716 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:20,417 INFO L93 Difference]: Finished difference Result 1338 states and 1826 transitions. [2024-10-11 16:34:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:34:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-11 16:34:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:20,423 INFO L225 Difference]: With dead ends: 1338 [2024-10-11 16:34:20,423 INFO L226 Difference]: Without dead ends: 899 [2024-10-11 16:34:20,424 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:34:20,425 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 939 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:20,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1917 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:34:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-11 16:34:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 668. [2024-10-11 16:34:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 656 states have (on average 1.3551829268292683) internal successors, (889), 662 states have internal predecessors, (889), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 16:34:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 905 transitions. [2024-10-11 16:34:20,438 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 905 transitions. Word has length 152 [2024-10-11 16:34:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:20,439 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 905 transitions. [2024-10-11 16:34:20,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 905 transitions. [2024-10-11 16:34:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 16:34:20,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:20,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:34:20,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:20,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1369233767, now seen corresponding path program 1 times [2024-10-11 16:34:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327460233] [2024-10-11 16:34:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:34:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:34:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327460233] [2024-10-11 16:34:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327460233] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54022886] [2024-10-11 16:34:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:21,058 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:34:21,062 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:34:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:21,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 16:34:21,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:21,407 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:34:21,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 16:34:21,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:21,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54022886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:21,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-11 16:34:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595334575] [2024-10-11 16:34:21,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:21,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:34:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:34:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:34:21,726 INFO L87 Difference]: Start difference. First operand 668 states and 905 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:34:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:22,184 INFO L93 Difference]: Finished difference Result 2161 states and 2937 transitions. [2024-10-11 16:34:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:34:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-11 16:34:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:22,190 INFO L225 Difference]: With dead ends: 2161 [2024-10-11 16:34:22,190 INFO L226 Difference]: Without dead ends: 1739 [2024-10-11 16:34:22,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:34:22,193 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1097 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:22,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 3761 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:34:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2024-10-11 16:34:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1014. [2024-10-11 16:34:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 998 states have (on average 1.3476953907815632) internal successors, (1345), 1004 states have internal predecessors, (1345), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:34:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1367 transitions. [2024-10-11 16:34:22,222 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1367 transitions. Word has length 162 [2024-10-11 16:34:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1367 transitions. [2024-10-11 16:34:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:34:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1367 transitions. [2024-10-11 16:34:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-11 16:34:22,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:22,226 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:22,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:34:22,427 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:34:22,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:22,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash -426138130, now seen corresponding path program 1 times [2024-10-11 16:34:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346023428] [2024-10-11 16:34:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:34:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:34:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346023428] [2024-10-11 16:34:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346023428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614352025] [2024-10-11 16:34:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:25,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:25,311 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:34:25,312 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:34:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:25,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:34:25,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:25,943 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:34:26,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 16:34:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:26,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:26,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:26,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614352025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:26,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:26,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-11 16:34:26,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763821682] [2024-10-11 16:34:26,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:26,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 16:34:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 16:34:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-11 16:34:26,834 INFO L87 Difference]: Start difference. First operand 1014 states and 1367 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:34:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:27,673 INFO L93 Difference]: Finished difference Result 4264 states and 5808 transitions. [2024-10-11 16:34:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:34:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-11 16:34:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:27,689 INFO L225 Difference]: With dead ends: 4264 [2024-10-11 16:34:27,689 INFO L226 Difference]: Without dead ends: 3842 [2024-10-11 16:34:27,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-11 16:34:27,695 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 5665 mSDsluCounter, 6048 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5705 SdHoareTripleChecker+Valid, 6491 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:27,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5705 Valid, 6491 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:34:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2024-10-11 16:34:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 1878. [2024-10-11 16:34:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1856 states have (on average 1.3421336206896552) internal successors, (2491), 1862 states have internal predecessors, (2491), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 16:34:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2525 transitions. [2024-10-11 16:34:27,802 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2525 transitions. Word has length 390 [2024-10-11 16:34:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:27,803 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2525 transitions. [2024-10-11 16:34:27,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:34:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2525 transitions. [2024-10-11 16:34:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-11 16:34:27,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:27,825 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:27,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:34:28,026 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:34:28,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:28,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1343692924, now seen corresponding path program 2 times [2024-10-11 16:34:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588760126] [2024-10-11 16:34:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms