./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-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_BER_test8-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 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:25:30,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:25:30,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:25:30,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:25:30,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:25:31,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:25:31,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:25:31,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:25:31,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:25:31,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:25:31,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:25:31,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:25:31,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:25:31,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:25:31,028 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:25:31,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:25:31,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:25:31,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:25:31,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:25:31,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:25:31,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:25:31,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:25:31,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:25:31,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:25:31,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:25:31,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:25:31,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:25:31,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:25:31,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:25:31,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:25:31,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:25:31,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:25:31,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:25:31,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:25:31,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:25:31,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:25:31,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:25:31,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:25:31,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:25:31,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:25:31,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:25:31,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:25:31,043 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 -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2024-10-11 16:25:31,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:25:31,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:25:31,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:25:31,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:25:31,321 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:25:31,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 16:25:32,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:25:33,205 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:25:33,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2024-10-11 16:25:33,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a23c1e44/20223cb3d8b8487b9c0b37fea2d255e8/FLAGe4ffc45d9 [2024-10-11 16:25:33,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a23c1e44/20223cb3d8b8487b9c0b37fea2d255e8 [2024-10-11 16:25:33,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:25:33,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:25:33,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:25:33,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:25:33,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:25:33,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:33" (1/1) ... [2024-10-11 16:25:33,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59602f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:33, skipping insertion in model container [2024-10-11 16:25:33,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:33" (1/1) ... [2024-10-11 16:25:33,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:25:33,966 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2024-10-11 16:25:34,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2024-10-11 16:25:34,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:25:34,117 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:25:34,152 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2024-10-11 16:25:34,196 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2024-10-11 16:25:34,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:25:34,251 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:25:34,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34 WrapperNode [2024-10-11 16:25:34,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:25:34,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:25:34,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:25:34,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:25:34,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,356 INFO L138 Inliner]: procedures = 177, calls = 289, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-10-11 16:25:34,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:25:34,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:25:34,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:25:34,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:25:34,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,489 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 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:25:34,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,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:25:34" (1/1) ... [2024-10-11 16:25:34,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:25:34,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:25:34,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:25:34,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:25:34,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (1/1) ... [2024-10-11 16:25:34,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:25:34,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:34,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:25:34,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:25:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:25:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:25:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:25:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:25:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:25:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:25:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:25:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:25:34,746 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:25:34,746 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-11 16:25:34,746 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-11 16:25:34,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:25:34,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:25:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:25:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:25:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:25:34,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:25:34,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:25:36,342 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2024-10-11 16:25:36,342 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:25:36,396 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:25:36,396 INFO L314 CfgBuilder]: Removed 62 assume(true) statements. [2024-10-11 16:25:36,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:36 BoogieIcfgContainer [2024-10-11 16:25:36,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:25:36,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:25:36,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:25:36,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:25:36,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:25:33" (1/3) ... [2024-10-11 16:25:36,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c396da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:36, skipping insertion in model container [2024-10-11 16:25:36,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:34" (2/3) ... [2024-10-11 16:25:36,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c396da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:36, skipping insertion in model container [2024-10-11 16:25:36,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:36" (3/3) ... [2024-10-11 16:25:36,404 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i [2024-10-11 16:25:36,420 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:25:36,420 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:25:36,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:25:36,510 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;@420de807, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:25:36,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:25:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 430 states, 404 states have (on average 1.636138613861386) internal successors, (661), 421 states have internal predecessors, (661), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 16:25:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 16:25:36,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:36,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:36,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1181736163, now seen corresponding path program 1 times [2024-10-11 16:25:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540567027] [2024-10-11 16:25:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:25:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540567027] [2024-10-11 16:25:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540567027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:25:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76133952] [2024-10-11 16:25:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:36,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:25:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:25:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:25:36,758 INFO L87 Difference]: Start difference. First operand has 430 states, 404 states have (on average 1.636138613861386) internal successors, (661), 421 states have internal predecessors, (661), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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:25:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:36,849 INFO L93 Difference]: Finished difference Result 859 states and 1418 transitions. [2024-10-11 16:25:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:25:36,852 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:25:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:36,870 INFO L225 Difference]: With dead ends: 859 [2024-10-11 16:25:36,871 INFO L226 Difference]: Without dead ends: 428 [2024-10-11 16:25:36,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:25:36,883 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:36,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:25:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-11 16:25:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-10-11 16:25:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 16:25:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2024-10-11 16:25:36,970 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 8 [2024-10-11 16:25:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:36,971 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2024-10-11 16:25:36,971 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:25:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2024-10-11 16:25:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 16:25:36,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:36,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:25:36,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 182152541, now seen corresponding path program 1 times [2024-10-11 16:25:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:36,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888006859] [2024-10-11 16:25:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:25:37,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888006859] [2024-10-11 16:25:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888006859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:25:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682033156] [2024-10-11 16:25:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:25:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:25:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:25:37,464 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:37,628 INFO L93 Difference]: Finished difference Result 1039 states and 1531 transitions. [2024-10-11 16:25:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:25:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-10-11 16:25:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:37,635 INFO L225 Difference]: With dead ends: 1039 [2024-10-11 16:25:37,635 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 16:25:37,638 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:25:37,640 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 546 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:37,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1821 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 16:25:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 430. [2024-10-11 16:25:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 16:25:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2024-10-11 16:25:37,667 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 63 [2024-10-11 16:25:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:37,667 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2024-10-11 16:25:37,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2024-10-11 16:25:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 16:25:37,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:37,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:25:37,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 205336912, now seen corresponding path program 1 times [2024-10-11 16:25:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918858600] [2024-10-11 16:25:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:25:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918858600] [2024-10-11 16:25:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918858600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:38,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:38,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:25:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609984111] [2024-10-11 16:25:38,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:38,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:25:38,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:25:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:25:38,003 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:38,104 INFO L93 Difference]: Finished difference Result 860 states and 1266 transitions. [2024-10-11 16:25:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:25:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 16:25:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:38,107 INFO L225 Difference]: With dead ends: 860 [2024-10-11 16:25:38,107 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 16:25:38,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:25:38,113 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 105 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:38,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1706 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 16:25:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2024-10-11 16:25:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4469135802469135) internal successors, (586), 421 states have internal predecessors, (586), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 16:25:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 626 transitions. [2024-10-11 16:25:38,130 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 626 transitions. Word has length 84 [2024-10-11 16:25:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 626 transitions. [2024-10-11 16:25:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 626 transitions. [2024-10-11 16:25:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 16:25:38,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:38,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:38,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:25:38,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash 361770564, now seen corresponding path program 1 times [2024-10-11 16:25:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830441640] [2024-10-11 16:25:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:25:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830441640] [2024-10-11 16:25:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830441640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:25:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392728787] [2024-10-11 16:25:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:25:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:25:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:25:38,332 INFO L87 Difference]: Start difference. First operand 430 states and 626 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:38,455 INFO L93 Difference]: Finished difference Result 1151 states and 1681 transitions. [2024-10-11 16:25:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:25:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 16:25:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:38,460 INFO L225 Difference]: With dead ends: 1151 [2024-10-11 16:25:38,460 INFO L226 Difference]: Without dead ends: 724 [2024-10-11 16:25:38,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:25:38,462 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 371 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:38,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1406 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-11 16:25:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 721. [2024-10-11 16:25:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 695 states have (on average 1.4561151079136692) internal successors, (1012), 711 states have internal predecessors, (1012), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1054 transitions. [2024-10-11 16:25:38,504 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1054 transitions. Word has length 84 [2024-10-11 16:25:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1054 transitions. [2024-10-11 16:25:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:25:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1054 transitions. [2024-10-11 16:25:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 16:25:38,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:38,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:25:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:25:38,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash 537647418, now seen corresponding path program 1 times [2024-10-11 16:25:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486018170] [2024-10-11 16:25:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:25:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:25:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:25:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486018170] [2024-10-11 16:25:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486018170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:25:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810375412] [2024-10-11 16:25:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:39,008 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:25:39,010 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:25:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:39,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 16:25:39,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:25:39,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:25:39,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 16:25:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:25:40,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:25:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810375412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:25:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2024-10-11 16:25:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797624625] [2024-10-11 16:25:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:25:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:25:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:25:40,438 INFO L87 Difference]: Start difference. First operand 721 states and 1054 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:42,638 INFO L93 Difference]: Finished difference Result 1690 states and 2454 transitions. [2024-10-11 16:25:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:25:42,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-10-11 16:25:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:42,646 INFO L225 Difference]: With dead ends: 1690 [2024-10-11 16:25:42,647 INFO L226 Difference]: Without dead ends: 1054 [2024-10-11 16:25:42,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:25:42,650 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 815 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 3729 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:42,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 3729 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 16:25:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-11 16:25:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 747. [2024-10-11 16:25:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4466019417475728) internal successors, (1043), 737 states have internal predecessors, (1043), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1085 transitions. [2024-10-11 16:25:42,675 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1085 transitions. Word has length 97 [2024-10-11 16:25:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1085 transitions. [2024-10-11 16:25:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1085 transitions. [2024-10-11 16:25:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 16:25:42,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:42,677 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:25:42,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:25:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:42,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:42,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2140648114, now seen corresponding path program 1 times [2024-10-11 16:25:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:42,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784540340] [2024-10-11 16:25:42,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:25:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:25:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:25:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784540340] [2024-10-11 16:25:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784540340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:25:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001894677] [2024-10-11 16:25:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:43,314 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:25:43,315 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:25:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:43,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 16:25:43,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:25:43,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:25:43,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 16:25:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:25:44,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:25:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001894677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:25:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2024-10-11 16:25:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952557957] [2024-10-11 16:25:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:44,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:25:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:25:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:25:44,606 INFO L87 Difference]: Start difference. First operand 747 states and 1085 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:47,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:25:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:48,243 INFO L93 Difference]: Finished difference Result 1738 states and 2518 transitions. [2024-10-11 16:25:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 16:25:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-10-11 16:25:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:48,249 INFO L225 Difference]: With dead ends: 1738 [2024-10-11 16:25:48,249 INFO L226 Difference]: Without dead ends: 1107 [2024-10-11 16:25:48,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-10-11 16:25:48,251 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 900 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:48,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2861 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 620 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 16:25:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-11 16:25:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 783. [2024-10-11 16:25:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 757 states have (on average 1.4385733157199472) internal successors, (1089), 773 states have internal predecessors, (1089), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1131 transitions. [2024-10-11 16:25:48,273 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1131 transitions. Word has length 98 [2024-10-11 16:25:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1131 transitions. [2024-10-11 16:25:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1131 transitions. [2024-10-11 16:25:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 16:25:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:48,275 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:25:48,294 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:25:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:48,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 215482958, now seen corresponding path program 1 times [2024-10-11 16:25:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080667004] [2024-10-11 16:25:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:25:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:25:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:25:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080667004] [2024-10-11 16:25:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080667004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:48,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:48,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:25:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313367455] [2024-10-11 16:25:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:48,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:25:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:25:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:25:48,841 INFO L87 Difference]: Start difference. First operand 783 states and 1131 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:49,945 INFO L93 Difference]: Finished difference Result 1476 states and 2146 transitions. [2024-10-11 16:25:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:25:49,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-10-11 16:25:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:49,949 INFO L225 Difference]: With dead ends: 1476 [2024-10-11 16:25:49,950 INFO L226 Difference]: Without dead ends: 819 [2024-10-11 16:25:49,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:25:49,951 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 68 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:49,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 3025 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:25:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-11 16:25:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 811. [2024-10-11 16:25:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 785 states have (on average 1.4394904458598725) internal successors, (1130), 801 states have internal predecessors, (1130), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1172 transitions. [2024-10-11 16:25:49,977 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1172 transitions. Word has length 99 [2024-10-11 16:25:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:49,977 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1172 transitions. [2024-10-11 16:25:49,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1172 transitions. [2024-10-11 16:25:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 16:25:49,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:49,979 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:25:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:25:49,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1989403755, now seen corresponding path program 1 times [2024-10-11 16:25:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064504877] [2024-10-11 16:25:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:25:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:25:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:25:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064504877] [2024-10-11 16:25:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064504877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:25:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:25:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16146660] [2024-10-11 16:25:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:25:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:25:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:25:50,381 INFO L87 Difference]: Start difference. First operand 811 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:51,189 INFO L93 Difference]: Finished difference Result 1502 states and 2183 transitions. [2024-10-11 16:25:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:25:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-10-11 16:25:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:51,195 INFO L225 Difference]: With dead ends: 1502 [2024-10-11 16:25:51,195 INFO L226 Difference]: Without dead ends: 819 [2024-10-11 16:25:51,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:25:51,198 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 63 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:51,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 2258 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:25:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-11 16:25:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2024-10-11 16:25:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 791 states have (on average 1.436156763590392) internal successors, (1136), 807 states have internal predecessors, (1136), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1178 transitions. [2024-10-11 16:25:51,237 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1178 transitions. Word has length 99 [2024-10-11 16:25:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1178 transitions. [2024-10-11 16:25:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1178 transitions. [2024-10-11 16:25:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 16:25:51,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:51,239 INFO L215 NwaCegarLoop]: trace histogram [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:25:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:25:51,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash -850258618, now seen corresponding path program 1 times [2024-10-11 16:25:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545608198] [2024-10-11 16:25:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:25:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:25:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:25:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545608198] [2024-10-11 16:25:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545608198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:25:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991619656] [2024-10-11 16:25:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:51,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:25:51,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:25:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:51,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 16:25:52,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:25:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:25:52,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:25:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991619656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:25:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 16:25:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004883256] [2024-10-11 16:25:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:25:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:25:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:25:52,104 INFO L87 Difference]: Start difference. First operand 817 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:52,674 INFO L93 Difference]: Finished difference Result 1530 states and 2217 transitions. [2024-10-11 16:25:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:25:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-10-11 16:25:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:52,678 INFO L225 Difference]: With dead ends: 1530 [2024-10-11 16:25:52,679 INFO L226 Difference]: Without dead ends: 837 [2024-10-11 16:25:52,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:25:52,682 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 43 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:52,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3085 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:25:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-11 16:25:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 813. [2024-10-11 16:25:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 803 states have internal predecessors, (1129), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:25:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1171 transitions. [2024-10-11 16:25:52,705 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1171 transitions. Word has length 100 [2024-10-11 16:25:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1171 transitions. [2024-10-11 16:25:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:25:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1171 transitions. [2024-10-11 16:25:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 16:25:52,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:52,708 INFO L215 NwaCegarLoop]: trace histogram [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:25:52,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 16:25:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:52,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 893901487, now seen corresponding path program 1 times [2024-10-11 16:25:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108141023] [2024-10-11 16:25:52,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:25:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:25:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:25:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108141023] [2024-10-11 16:25:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108141023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:25:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144928473] [2024-10-11 16:25:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:53,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:53,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:53,281 INFO L229 MonitoredProcess]: Starting monitored process 5 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:25:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:25:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:54,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 16:25:54,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:25:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:25:54,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:25:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144928473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:54,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:25:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 16:25:54,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977923854] [2024-10-11 16:25:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:25:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:25:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:25:54,442 INFO L87 Difference]: Start difference. First operand 813 states and 1171 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:25:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:25:54,530 INFO L93 Difference]: Finished difference Result 1404 states and 2031 transitions. [2024-10-11 16:25:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:25:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-10-11 16:25:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:25:54,534 INFO L225 Difference]: With dead ends: 1404 [2024-10-11 16:25:54,534 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 16:25:54,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:25:54,536 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 24 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:25:54,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2097 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:25:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 16:25:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2024-10-11 16:25:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 618 states have (on average 1.4223300970873787) internal successors, (879), 635 states have internal predecessors, (879), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 16:25:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 922 transitions. [2024-10-11 16:25:54,557 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 922 transitions. Word has length 100 [2024-10-11 16:25:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:25:54,557 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 922 transitions. [2024-10-11 16:25:54,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:25:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 922 transitions. [2024-10-11 16:25:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 16:25:54,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:25:54,559 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:25:54,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:25:54,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 16:25:54,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:25:54,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:25:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1120818715, now seen corresponding path program 1 times [2024-10-11 16:25:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:25:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284324614] [2024-10-11 16:25:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:25:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:25:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:25:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:25:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:25:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284324614] [2024-10-11 16:25:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284324614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:25:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650321400] [2024-10-11 16:25:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:25:55,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:25:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:25:55,292 INFO L229 MonitoredProcess]: Starting monitored process 6 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:25:55,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:25:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:25:55,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 16:25:55,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:25:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 16:25:55,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:25:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650321400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:25:55,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:25:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 16:25:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218241513] [2024-10-11 16:25:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:25:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:25:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:25:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:25:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:25:55,927 INFO L87 Difference]: Start difference. First operand 645 states and 922 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:00,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:26:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:00,373 INFO L93 Difference]: Finished difference Result 1246 states and 1794 transitions. [2024-10-11 16:26:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:26:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 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:26:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:00,377 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 16:26:00,377 INFO L226 Difference]: Without dead ends: 655 [2024-10-11 16:26:00,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:26:00,379 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 12 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:00,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2803 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 16:26:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-11 16:26:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 651. [2024-10-11 16:26:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 624 states have (on average 1.4182692307692308) internal successors, (885), 641 states have internal predecessors, (885), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 16:26:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 928 transitions. [2024-10-11 16:26:00,396 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 928 transitions. Word has length 102 [2024-10-11 16:26:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:00,396 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 928 transitions. [2024-10-11 16:26:00,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 928 transitions. [2024-10-11 16:26:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 16:26:00,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:00,399 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] [2024-10-11 16:26:00,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 16:26:00,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 16:26:00,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:00,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1523764491, now seen corresponding path program 1 times [2024-10-11 16:26:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366539973] [2024-10-11 16:26:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:26:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:26:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 16:26:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366539973] [2024-10-11 16:26:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366539973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:26:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:26:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:26:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282853234] [2024-10-11 16:26:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:26:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:26:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:26:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:26:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:26:01,114 INFO L87 Difference]: Start difference. First operand 651 states and 928 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:26:02,166 INFO L93 Difference]: Finished difference Result 1275 states and 1830 transitions. [2024-10-11 16:26:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:26:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2024-10-11 16:26:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:26:02,170 INFO L225 Difference]: With dead ends: 1275 [2024-10-11 16:26:02,171 INFO L226 Difference]: Without dead ends: 683 [2024-10-11 16:26:02,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:26:02,172 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 80 mSDsluCounter, 2807 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:26:02,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 3270 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:26:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-11 16:26:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 671. [2024-10-11 16:26:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 644 states have (on average 1.4114906832298137) internal successors, (909), 661 states have internal predecessors, (909), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-11 16:26:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 952 transitions. [2024-10-11 16:26:02,195 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 952 transitions. Word has length 104 [2024-10-11 16:26:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:26:02,195 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 952 transitions. [2024-10-11 16:26:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:26:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 952 transitions. [2024-10-11 16:26:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 16:26:02,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:26:02,197 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] [2024-10-11 16:26:02,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:26:02,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:26:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:26:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 251281846, now seen corresponding path program 1 times [2024-10-11 16:26:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:26:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031055283] [2024-10-11 16:26:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:26:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:26:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:26:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:26:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:26:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031055283] [2024-10-11 16:26:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031055283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:26:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046543162] [2024-10-11 16:26:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:26:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:26:02,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:26:02,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:26:02,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 16:26:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:26:03,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-11 16:26:03,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:26:03,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 16:26:03,274 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 19 treesize of output 1 [2024-10-11 16:26:03,277 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 19 treesize of output 1 [2024-10-11 16:26:03,300 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-10-11 16:26:03,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-10-11 16:26:03,356 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 22 treesize of output 10 [2024-10-11 16:26:03,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 16:26:03,507 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 16:26:03,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1