./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_SFH_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:41:07,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:41:07,340 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:41:07,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:41:07,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:41:07,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:41:07,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:41:07,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:41:07,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:41:07,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:41:07,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:41:07,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:41:07,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:41:07,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:41:07,387 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:41:07,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:41:07,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:41:07,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:41:07,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:41:07,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:41:07,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:41:07,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:41:07,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:41:07,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:41:07,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:41:07,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:41:07,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:41:07,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:41:07,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:41:07,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:41:07,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:41:07,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:41:07,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:41:07,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:41:07,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:41:07,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:41:07,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:41:07,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:41:07,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:41:07,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:41:07,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:41:07,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:41:07,398 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2024-10-11 16:41:07,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:41:07,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:41:07,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:41:07,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:41:07,692 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:41:07,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2024-10-11 16:41:09,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:41:09,400 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:41:09,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2024-10-11 16:41:09,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa3b11cbf/3e1ea19154c5465db895147cebaadd11/FLAGc4d398d34 [2024-10-11 16:41:09,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa3b11cbf/3e1ea19154c5465db895147cebaadd11 [2024-10-11 16:41:09,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:41:09,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:41:09,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:41:09,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:41:09,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:41:09,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:09" (1/1) ... [2024-10-11 16:41:09,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305a85ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:09, skipping insertion in model container [2024-10-11 16:41:09,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:09" (1/1) ... [2024-10-11 16:41:09,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:41:09,891 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_SFH_test3-1.i[33021,33034] [2024-10-11 16:41:10,030 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_SFH_test3-1.i[44590,44603] [2024-10-11 16:41:10,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:41:10,065 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:41:10,110 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_SFH_test3-1.i[33021,33034] [2024-10-11 16:41:10,203 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_SFH_test3-1.i[44590,44603] [2024-10-11 16:41:10,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:41:10,262 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:41:10,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10 WrapperNode [2024-10-11 16:41:10,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:41:10,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:41:10,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:41:10,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:41:10,273 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:41:10" (1/1) ... [2024-10-11 16:41:10,319 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:41:10" (1/1) ... [2024-10-11 16:41:10,402 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1455 [2024-10-11 16:41:10,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:41:10,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:41:10,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:41:10,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:41:10,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,527 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 16:41:10,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:41:10,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:41:10,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:41:10,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:41:10,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (1/1) ... [2024-10-11 16:41:10,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:41:10,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:41:10,671 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:41:10,674 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:41:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:41:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:41:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:41:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:41:10,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:41:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:41:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:41:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:41:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:41:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:41:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:41:10,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:41:10,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:41:10,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:41:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:41:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:41:10,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:41:10,943 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:41:10,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:41:12,404 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-10-11 16:41:12,405 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:41:12,459 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:41:12,463 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:41:12,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:41:12 BoogieIcfgContainer [2024-10-11 16:41:12,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:41:12,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:41:12,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:41:12,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:41:12,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:41:09" (1/3) ... [2024-10-11 16:41:12,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4740d4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:41:12, skipping insertion in model container [2024-10-11 16:41:12,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:10" (2/3) ... [2024-10-11 16:41:12,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4740d4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:41:12, skipping insertion in model container [2024-10-11 16:41:12,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:41:12" (3/3) ... [2024-10-11 16:41:12,473 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2024-10-11 16:41:12,491 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:41:12,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:41:12,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:41:12,607 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;@6b4d01fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:41:12,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:41:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 393 states have (on average 1.633587786259542) internal successors, (642), 400 states have internal predecessors, (642), 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:41:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:41:12,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:12,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:41:12,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1914372056, now seen corresponding path program 1 times [2024-10-11 16:41:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984683379] [2024-10-11 16:41:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:12,810 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:41:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984683379] [2024-10-11 16:41:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984683379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:41:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797049621] [2024-10-11 16:41:12,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:41:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:41:12,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:41:12,845 INFO L87 Difference]: Start difference. First operand has 406 states, 393 states have (on average 1.633587786259542) internal successors, (642), 400 states have internal predecessors, (642), 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:41:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:12,934 INFO L93 Difference]: Finished difference Result 811 states and 1320 transitions. [2024-10-11 16:41:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:41:12,940 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:41:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:12,957 INFO L225 Difference]: With dead ends: 811 [2024-10-11 16:41:12,958 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 16:41:12,963 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:41:12,970 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:41:12,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:41:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 16:41:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-10-11 16:41:13,046 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:41:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2024-10-11 16:41:13,050 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 8 [2024-10-11 16:41:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2024-10-11 16:41:13,051 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:41:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2024-10-11 16:41:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 16:41:13,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:13,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:41:13,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:41:13,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash 430792996, now seen corresponding path program 1 times [2024-10-11 16:41:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057190592] [2024-10-11 16:41:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:13,282 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:41:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057190592] [2024-10-11 16:41:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057190592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:41:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076742762] [2024-10-11 16:41:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:41:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:13,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:41:13,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:41:13,287 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:41:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:13,466 INFO L93 Difference]: Finished difference Result 1002 states and 1464 transitions. [2024-10-11 16:41:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:41:13,467 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:41:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:13,471 INFO L225 Difference]: With dead ends: 1002 [2024-10-11 16:41:13,472 INFO L226 Difference]: Without dead ends: 797 [2024-10-11 16:41:13,473 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:41:13,474 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 558 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1776 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:41:13,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1776 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:41:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-11 16:41:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 406. [2024-10-11 16:41:13,513 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:41:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2024-10-11 16:41:13,518 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 13 [2024-10-11 16:41:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2024-10-11 16:41:13,519 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:41:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2024-10-11 16:41:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 16:41:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:13,524 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:41:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:41:13,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1311525701, now seen corresponding path program 1 times [2024-10-11 16:41:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006504111] [2024-10-11 16:41:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:13,918 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:41:13,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:13,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006504111] [2024-10-11 16:41:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006504111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:13,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:13,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:41:13,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882253905] [2024-10-11 16:41:13,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:13,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:41:13,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:41:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:41:13,921 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:41:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:14,017 INFO L93 Difference]: Finished difference Result 767 states and 1109 transitions. [2024-10-11 16:41:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:41:14,018 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:41:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:14,020 INFO L225 Difference]: With dead ends: 767 [2024-10-11 16:41:14,020 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 16:41:14,021 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:41:14,022 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:41:14,023 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:41:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 16:41:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-11 16:41:14,036 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:41:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 512 transitions. [2024-10-11 16:41:14,038 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 512 transitions. Word has length 89 [2024-10-11 16:41:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:14,040 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 512 transitions. [2024-10-11 16:41:14,040 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:41:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 512 transitions. [2024-10-11 16:41:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 16:41:14,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:14,043 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:41:14,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:41:14,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash -58083887, now seen corresponding path program 1 times [2024-10-11 16:41:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:14,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063565708] [2024-10-11 16:41:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:14,209 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:41:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:14,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063565708] [2024-10-11 16:41:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063565708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:14,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:41:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452528935] [2024-10-11 16:41:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:14,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:41:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:41:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:41:14,216 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:41:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:14,345 INFO L93 Difference]: Finished difference Result 976 states and 1382 transitions. [2024-10-11 16:41:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:41:14,345 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:41:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:14,348 INFO L225 Difference]: With dead ends: 976 [2024-10-11 16:41:14,348 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 16:41:14,353 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:41:14,355 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 295 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1165 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:41:14,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1165 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:41:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 16:41:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2024-10-11 16:41:14,379 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:41:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 868 transitions. [2024-10-11 16:41:14,382 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 868 transitions. Word has length 89 [2024-10-11 16:41:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:14,383 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 868 transitions. [2024-10-11 16:41:14,385 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:41:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 868 transitions. [2024-10-11 16:41:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 16:41:14,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:14,392 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:41:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:41:14,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:14,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash 728665887, now seen corresponding path program 1 times [2024-10-11 16:41:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:14,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513216455] [2024-10-11 16:41:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:41:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:41:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:14,882 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:41:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513216455] [2024-10-11 16:41:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513216455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:41:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265492471] [2024-10-11 16:41:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:41:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:41:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:41:14,904 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:41:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:15,268 INFO L93 Difference]: Finished difference Result 910 states and 1299 transitions. [2024-10-11 16:41:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:41:15,270 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:41:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:15,276 INFO L225 Difference]: With dead ends: 910 [2024-10-11 16:41:15,277 INFO L226 Difference]: Without dead ends: 891 [2024-10-11 16:41:15,278 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:41:15,280 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 465 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:41:15,281 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:41:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-10-11 16:41:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 613. [2024-10-11 16:41:15,298 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:41:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 870 transitions. [2024-10-11 16:41:15,302 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 870 transitions. Word has length 102 [2024-10-11 16:41:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:15,305 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 870 transitions. [2024-10-11 16:41:15,305 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:41:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 870 transitions. [2024-10-11 16:41:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:41:15,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:15,309 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:41:15,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:41:15,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -358696883, now seen corresponding path program 1 times [2024-10-11 16:41:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900987157] [2024-10-11 16:41:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:41:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:41:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:15,645 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:41:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900987157] [2024-10-11 16:41:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900987157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:41:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230513285] [2024-10-11 16:41:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:41:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:41:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:41:15,648 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:41:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:16,002 INFO L93 Difference]: Finished difference Result 895 states and 1280 transitions. [2024-10-11 16:41:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:41:16,003 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:41:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:16,005 INFO L225 Difference]: With dead ends: 895 [2024-10-11 16:41:16,005 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 16:41:16,006 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:41:16,007 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 37 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:41:16,008 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.3s Time] [2024-10-11 16:41:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 16:41:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2024-10-11 16:41:16,022 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:41:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2024-10-11 16:41:16,026 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 152 [2024-10-11 16:41:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:16,027 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2024-10-11 16:41:16,027 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:41:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2024-10-11 16:41:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 16:41:16,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:16,031 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:41:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:41:16,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:16,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1530211007, now seen corresponding path program 1 times [2024-10-11 16:41:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705272413] [2024-10-11 16:41:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:41:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:41:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:16,359 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:41:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705272413] [2024-10-11 16:41:16,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705272413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:41:16,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:41:16,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:41:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759166219] [2024-10-11 16:41:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:41:16,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:41:16,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:41:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:41:16,363 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:41:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:16,951 INFO L93 Difference]: Finished difference Result 1326 states and 1804 transitions. [2024-10-11 16:41:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:41:16,951 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:41:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:16,955 INFO L225 Difference]: With dead ends: 1326 [2024-10-11 16:41:16,956 INFO L226 Difference]: Without dead ends: 887 [2024-10-11 16:41:16,957 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:41:16,957 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1351 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:41:16,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1623 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:41:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-11 16:41:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 668. [2024-10-11 16:41:17,002 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:41:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 905 transitions. [2024-10-11 16:41:17,005 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 905 transitions. Word has length 152 [2024-10-11 16:41:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 905 transitions. [2024-10-11 16:41:17,005 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:41:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 905 transitions. [2024-10-11 16:41:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 16:41:17,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:17,007 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:41:17,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:41:17,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 591783349, now seen corresponding path program 1 times [2024-10-11 16:41:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615340952] [2024-10-11 16:41:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:41:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:41:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:17,907 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:41:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615340952] [2024-10-11 16:41:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615340952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:41:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950727952] [2024-10-11 16:41:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:17,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:41:17,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:41:17,911 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:41:17,912 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:41:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:18,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 16:41:18,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:41:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:41:18,596 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:41:18,609 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:41:18,616 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:41:18,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:41:18,833 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:41:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950727952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:41:18,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:41:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-11 16:41:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090639600] [2024-10-11 16:41:18,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:41:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:41:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:41:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:41:18,836 INFO L87 Difference]: Start difference. First operand 668 states and 905 transitions. Second operand has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:41:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:19,440 INFO L93 Difference]: Finished difference Result 2161 states and 2937 transitions. [2024-10-11 16:41:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:41:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2024-10-11 16:41:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:19,447 INFO L225 Difference]: With dead ends: 2161 [2024-10-11 16:41:19,448 INFO L226 Difference]: Without dead ends: 1739 [2024-10-11 16:41:19,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:41:19,450 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1176 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 3538 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:41:19,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 3538 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:41:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2024-10-11 16:41:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1014. [2024-10-11 16:41:19,490 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:41:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1367 transitions. [2024-10-11 16:41:19,493 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1367 transitions. Word has length 162 [2024-10-11 16:41:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:19,494 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1367 transitions. [2024-10-11 16:41:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:41:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1367 transitions. [2024-10-11 16:41:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-11 16:41:19,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:19,499 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:41:19,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:41:19,700 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:41:19,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:19,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1894067396, now seen corresponding path program 1 times [2024-10-11 16:41:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187821338] [2024-10-11 16:41:19,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:41:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:23,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:41:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:41:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:23,463 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:41:23,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:41:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187821338] [2024-10-11 16:41:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187821338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:41:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551470185] [2024-10-11 16:41:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:23,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:41:23,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:41:23,466 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:41:23,468 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:41:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:41:24,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 16:41:24,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:41:24,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:41:24,416 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:41:24,538 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:41:24,653 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:41:24,769 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:41:24,778 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:41:24,783 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:41:24,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:41:25,340 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:41:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551470185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:41:25,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:41:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-11 16:41:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809346289] [2024-10-11 16:41:25,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:41:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 16:41:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:41:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 16:41:25,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:41:25,345 INFO L87 Difference]: Start difference. First operand 1014 states and 1367 transitions. Second operand has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:41:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:41:26,380 INFO L93 Difference]: Finished difference Result 4264 states and 5808 transitions. [2024-10-11 16:41:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:41:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 390 [2024-10-11 16:41:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:41:26,396 INFO L225 Difference]: With dead ends: 4264 [2024-10-11 16:41:26,397 INFO L226 Difference]: Without dead ends: 3842 [2024-10-11 16:41:26,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-10-11 16:41:26,402 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 5526 mSDsluCounter, 4772 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5570 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:41:26,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5570 Valid, 5216 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:41:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2024-10-11 16:41:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 1878. [2024-10-11 16:41:26,492 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:41:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2525 transitions. [2024-10-11 16:41:26,501 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2525 transitions. Word has length 390 [2024-10-11 16:41:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:41:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2525 transitions. [2024-10-11 16:41:26,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 16:41:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2525 transitions. [2024-10-11 16:41:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-11 16:41:26,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:41:26,521 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:41:26,547 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:41:26,721 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:41:26,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:41:26,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:41:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 730533834, now seen corresponding path program 2 times [2024-10-11 16:41:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:41:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105342731] [2024-10-11 16:41:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:41:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms