./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:27:35,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:27:35,853 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:27:35,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:27:35,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:27:35,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:27:35,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:27:35,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:27:35,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:27:35,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:27:35,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:27:35,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:27:35,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:27:35,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:27:35,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:27:35,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:27:35,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:27:35,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:27:35,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:27:35,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:27:35,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:27:35,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:27:35,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:27:35,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:27:35,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:27:35,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:27:35,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:27:35,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:27:35,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:27:35,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:27:35,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:27:35,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:27:35,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:27:35,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:27:35,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:27:35,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:27:35,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:27:35,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:27:35,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:27:35,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:27:35,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:27:35,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:27:35,897 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2024-10-11 16:27:36,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:27:36,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:27:36,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:27:36,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:27:36,135 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:27:36,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-10-11 16:27:37,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:27:37,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:27:37,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-10-11 16:27:37,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e5dc4cb9/d2122fdc31e6423896611ac88415b69f/FLAG56b789406 [2024-10-11 16:27:37,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e5dc4cb9/d2122fdc31e6423896611ac88415b69f [2024-10-11 16:27:37,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:27:37,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:27:37,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:27:37,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:27:37,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:27:37,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:37" (1/1) ... [2024-10-11 16:27:37,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6207b5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:37, skipping insertion in model container [2024-10-11 16:27:37,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:37" (1/1) ... [2024-10-11 16:27:38,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:27:38,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[33021,33034] [2024-10-11 16:27:38,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[49681,49694] [2024-10-11 16:27:38,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:27:38,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:27:38,588 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[33021,33034] [2024-10-11 16:27:38,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[49681,49694] [2024-10-11 16:27:38,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:27:38,729 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:27:38,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38 WrapperNode [2024-10-11 16:27:38,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:27:38,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:27:38,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:27:38,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:27:38,737 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:27:38" (1/1) ... [2024-10-11 16:27:38,767 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:27:38" (1/1) ... [2024-10-11 16:27:38,848 INFO L138 Inliner]: procedures = 177, calls = 373, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2036 [2024-10-11 16:27:38,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:27:38,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:27:38,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:27:38,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:27:38,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:38,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:38,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:38,979 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-10-11 16:27:38,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:38,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:27:39,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:27:39,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:27:39,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:27:39,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (1/1) ... [2024-10-11 16:27:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:27:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:39,085 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:27:39,090 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:27:39,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:27:39,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:27:39,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:27:39,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:27:39,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:27:39,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:27:39,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:27:39,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:27:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:27:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:27:39,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:27:39,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:27:39,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:27:39,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:27:39,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:27:39,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:27:39,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:27:39,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:27:40,885 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2024-10-11 16:27:40,885 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:27:40,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:27:40,938 INFO L314 CfgBuilder]: Removed 83 assume(true) statements. [2024-10-11 16:27:40,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:40 BoogieIcfgContainer [2024-10-11 16:27:40,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:27:40,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:27:40,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:27:40,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:27:40,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:27:37" (1/3) ... [2024-10-11 16:27:40,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664ada96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:40, skipping insertion in model container [2024-10-11 16:27:40,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:38" (2/3) ... [2024-10-11 16:27:40,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664ada96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:40, skipping insertion in model container [2024-10-11 16:27:40,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:40" (3/3) ... [2024-10-11 16:27:40,946 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2024-10-11 16:27:40,960 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:27:40,960 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 16:27:41,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:27:41,033 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;@3e2012c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:27:41,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 16:27:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 564 states, 548 states have (on average 1.6295620437956204) internal successors, (893), 555 states have internal predecessors, (893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:27:41,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:41,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:27:41,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1065473808, now seen corresponding path program 1 times [2024-10-11 16:27:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:41,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831798] [2024-10-11 16:27:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:41,404 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:27:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831798] [2024-10-11 16:27:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:27:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669207003] [2024-10-11 16:27:41,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:27:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:27:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:27:41,474 INFO L87 Difference]: Start difference. First operand has 564 states, 548 states have (on average 1.6295620437956204) internal successors, (893), 555 states have internal predecessors, (893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:27:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:41,723 INFO L93 Difference]: Finished difference Result 1678 states and 2742 transitions. [2024-10-11 16:27:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:27:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 16:27:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:41,744 INFO L225 Difference]: With dead ends: 1678 [2024-10-11 16:27:41,744 INFO L226 Difference]: Without dead ends: 1113 [2024-10-11 16:27:41,751 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:27:41,755 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 786 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:41,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1674 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:27:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-11 16:27:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 563. [2024-10-11 16:27:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 548 states have (on average 1.4598540145985401) internal successors, (800), 554 states have internal predecessors, (800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 822 transitions. [2024-10-11 16:27:41,837 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 822 transitions. Word has length 7 [2024-10-11 16:27:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:41,838 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 822 transitions. [2024-10-11 16:27:41,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:27:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 822 transitions. [2024-10-11 16:27:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 16:27:41,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:41,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:41,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:27:41,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:41,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1673137066, now seen corresponding path program 1 times [2024-10-11 16:27:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951308113] [2024-10-11 16:27:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:27:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951308113] [2024-10-11 16:27:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951308113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:27:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182743561] [2024-10-11 16:27:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:42,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:27:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:27:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:27:42,777 INFO L87 Difference]: Start difference. First operand 563 states and 822 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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:27:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:42,878 INFO L93 Difference]: Finished difference Result 1127 states and 1645 transitions. [2024-10-11 16:27:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:27:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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 207 [2024-10-11 16:27:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:42,881 INFO L225 Difference]: With dead ends: 1127 [2024-10-11 16:27:42,881 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 16:27:42,882 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:27:42,883 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 105 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:42,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2279 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:27:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 16:27:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2024-10-11 16:27:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 548 states have (on average 1.447080291970803) internal successors, (793), 554 states have internal predecessors, (793), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 815 transitions. [2024-10-11 16:27:42,902 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 815 transitions. Word has length 207 [2024-10-11 16:27:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:42,903 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 815 transitions. [2024-10-11 16:27:42,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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:27:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 815 transitions. [2024-10-11 16:27:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 16:27:42,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:42,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:27:42,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 133587614, now seen corresponding path program 1 times [2024-10-11 16:27:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313634007] [2024-10-11 16:27:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:27:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313634007] [2024-10-11 16:27:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313634007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:27:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24581835] [2024-10-11 16:27:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:27:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:27:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:27:43,167 INFO L87 Difference]: Start difference. First operand 563 states and 815 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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:27:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:43,217 INFO L93 Difference]: Finished difference Result 1253 states and 1817 transitions. [2024-10-11 16:27:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:27:43,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 207 [2024-10-11 16:27:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:43,220 INFO L225 Difference]: With dead ends: 1253 [2024-10-11 16:27:43,220 INFO L226 Difference]: Without dead ends: 692 [2024-10-11 16:27:43,221 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:27:43,222 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 134 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:43,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1614 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:27:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-10-11 16:27:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-10-11 16:27:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 677 states have (on average 1.4490398818316101) internal successors, (981), 683 states have internal predecessors, (981), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1003 transitions. [2024-10-11 16:27:43,238 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1003 transitions. Word has length 207 [2024-10-11 16:27:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:43,238 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1003 transitions. [2024-10-11 16:27:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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:27:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1003 transitions. [2024-10-11 16:27:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 16:27:43,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:43,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:27:43,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -437572851, now seen corresponding path program 1 times [2024-10-11 16:27:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56018943] [2024-10-11 16:27:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:43,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:27:43,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56018943] [2024-10-11 16:27:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56018943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:43,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:27:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906856972] [2024-10-11 16:27:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:43,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:27:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:27:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:27:43,561 INFO L87 Difference]: Start difference. First operand 692 states and 1003 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:27:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:43,882 INFO L93 Difference]: Finished difference Result 1258 states and 1827 transitions. [2024-10-11 16:27:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:27:43,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 220 [2024-10-11 16:27:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:43,888 INFO L225 Difference]: With dead ends: 1258 [2024-10-11 16:27:43,888 INFO L226 Difference]: Without dead ends: 697 [2024-10-11 16:27:43,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:27:43,892 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 112 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:43,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2899 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:27:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-11 16:27:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 692. [2024-10-11 16:27:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 677 states have (on average 1.4387001477104875) internal successors, (974), 683 states have internal predecessors, (974), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 16:27:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 996 transitions. [2024-10-11 16:27:43,912 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 996 transitions. Word has length 220 [2024-10-11 16:27:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:43,913 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 996 transitions. [2024-10-11 16:27:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:27:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 996 transitions. [2024-10-11 16:27:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 16:27:43,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:43,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:27:43,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1061997977, now seen corresponding path program 1 times [2024-10-11 16:27:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436396210] [2024-10-11 16:27:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:27:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436396210] [2024-10-11 16:27:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436396210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:27:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:27:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441696199] [2024-10-11 16:27:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:27:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:27:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:27:44,178 INFO L87 Difference]: Start difference. First operand 692 states and 996 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:27:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:44,497 INFO L93 Difference]: Finished difference Result 1589 states and 2304 transitions. [2024-10-11 16:27:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:27:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 220 [2024-10-11 16:27:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:44,502 INFO L225 Difference]: With dead ends: 1589 [2024-10-11 16:27:44,502 INFO L226 Difference]: Without dead ends: 1028 [2024-10-11 16:27:44,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:27:44,504 INFO L432 NwaCegarLoop]: 992 mSDtfsCounter, 537 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:44,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2654 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:27:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-10-11 16:27:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1024. [2024-10-11 16:27:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1001 states have (on average 1.4445554445554445) internal successors, (1446), 1012 states have internal predecessors, (1446), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:27:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1484 transitions. [2024-10-11 16:27:44,525 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1484 transitions. Word has length 220 [2024-10-11 16:27:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1484 transitions. [2024-10-11 16:27:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:27:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1484 transitions. [2024-10-11 16:27:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:27:44,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:44,528 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:44,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:27:44,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:44,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 912835652, now seen corresponding path program 1 times [2024-10-11 16:27:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:44,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686602148] [2024-10-11 16:27:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:27:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:27:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686602148] [2024-10-11 16:27:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686602148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:27:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614497528] [2024-10-11 16:27:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:44,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:44,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:44,905 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:27:44,908 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:27:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:27:45,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:27:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 16:27:45,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:27:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614497528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:27:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 16:27:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959895999] [2024-10-11 16:27:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:27:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:27:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:27:45,352 INFO L87 Difference]: Start difference. First operand 1024 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:27:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:45,413 INFO L93 Difference]: Finished difference Result 1381 states and 2022 transitions. [2024-10-11 16:27:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:27:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-11 16:27:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:45,417 INFO L225 Difference]: With dead ends: 1381 [2024-10-11 16:27:45,417 INFO L226 Difference]: Without dead ends: 1064 [2024-10-11 16:27:45,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:27:45,419 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 8 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:45,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1554 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:27:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-10-11 16:27:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2024-10-11 16:27:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1041 states have (on average 1.4274735830931797) internal successors, (1486), 1052 states have internal predecessors, (1486), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:27:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1524 transitions. [2024-10-11 16:27:45,444 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1524 transitions. Word has length 233 [2024-10-11 16:27:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:45,445 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1524 transitions. [2024-10-11 16:27:45,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:27:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1524 transitions. [2024-10-11 16:27:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:27:45,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:45,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:45,464 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:27:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:45,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:45,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2010324346, now seen corresponding path program 1 times [2024-10-11 16:27:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014648100] [2024-10-11 16:27:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:45,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:27:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:27:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014648100] [2024-10-11 16:27:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014648100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:27:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809568535] [2024-10-11 16:27:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:45,993 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:27:45,997 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:27:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:46,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:27:46,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:27:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 16:27:46,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:27:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809568535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:27:46,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:27:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:27:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388332264] [2024-10-11 16:27:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:27:46,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:27:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:27:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:27:46,438 INFO L87 Difference]: Start difference. First operand 1064 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:27:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:46,503 INFO L93 Difference]: Finished difference Result 1393 states and 2014 transitions. [2024-10-11 16:27:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:27:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-11 16:27:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:46,508 INFO L225 Difference]: With dead ends: 1393 [2024-10-11 16:27:46,508 INFO L226 Difference]: Without dead ends: 1036 [2024-10-11 16:27:46,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:27:46,509 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 105 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:46,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2237 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:27:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-10-11 16:27:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2024-10-11 16:27:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1013 states have (on average 1.4254689042448174) internal successors, (1444), 1024 states have internal predecessors, (1444), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:27:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1482 transitions. [2024-10-11 16:27:46,529 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1482 transitions. Word has length 233 [2024-10-11 16:27:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:46,530 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1482 transitions. [2024-10-11 16:27:46,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:27:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1482 transitions. [2024-10-11 16:27:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 16:27:46,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:46,532 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:46,552 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:27:46,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:46,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash -258678472, now seen corresponding path program 1 times [2024-10-11 16:27:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779067261] [2024-10-11 16:27:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:27:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:27:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779067261] [2024-10-11 16:27:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779067261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:27:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608907175] [2024-10-11 16:27:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:47,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:47,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:47,028 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:27:47,032 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:27:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:47,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:27:47,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:27:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:47,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:27:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608907175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:27:47,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:27:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-11 16:27:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762474014] [2024-10-11 16:27:47,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:27:47,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:27:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:27:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:27:47,795 INFO L87 Difference]: Start difference. First operand 1036 states and 1482 transitions. Second operand has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:27:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:27:48,298 INFO L93 Difference]: Finished difference Result 2711 states and 3908 transitions. [2024-10-11 16:27:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:27:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2024-10-11 16:27:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:27:48,306 INFO L225 Difference]: With dead ends: 2711 [2024-10-11 16:27:48,307 INFO L226 Difference]: Without dead ends: 2381 [2024-10-11 16:27:48,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:27:48,308 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 4876 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4923 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:27:48,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4923 Valid, 4433 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:27:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2024-10-11 16:27:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 1867. [2024-10-11 16:27:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1829 states have (on average 1.413340623291416) internal successors, (2585), 1840 states have internal predecessors, (2585), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 16:27:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2653 transitions. [2024-10-11 16:27:48,347 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2653 transitions. Word has length 233 [2024-10-11 16:27:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:27:48,348 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2653 transitions. [2024-10-11 16:27:48,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:27:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2653 transitions. [2024-10-11 16:27:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-11 16:27:48,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:27:48,357 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:48,389 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:27:48,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:48,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:27:48,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:27:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1924089661, now seen corresponding path program 1 times [2024-10-11 16:27:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:27:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671411869] [2024-10-11 16:27:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:27:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:27:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:27:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:27:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:27:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-10-11 16:27:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:27:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671411869] [2024-10-11 16:27:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671411869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:27:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164541702] [2024-10-11 16:27:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:27:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:27:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:27:49,943 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:27:49,944 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:27:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:27:50,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:27:50,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:27:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:51,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:27:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:27:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164541702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:27:52,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:27:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-11 16:27:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078432455] [2024-10-11 16:27:52,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:27:52,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 16:27:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:27:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 16:27:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-10-11 16:27:52,028 INFO L87 Difference]: Start difference. First operand 1867 states and 2653 transitions. Second operand has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 16:28:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:28:00,140 INFO L93 Difference]: Finished difference Result 18100 states and 26057 transitions. [2024-10-11 16:28:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 16:28:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 671 [2024-10-11 16:28:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:28:00,206 INFO L225 Difference]: With dead ends: 18100 [2024-10-11 16:28:00,206 INFO L226 Difference]: Without dead ends: 16936 [2024-10-11 16:28:00,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1408 GetRequests, 1339 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 16:28:00,220 INFO L432 NwaCegarLoop]: 1753 mSDtfsCounter, 46397 mSDsluCounter, 16702 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46397 SdHoareTripleChecker+Valid, 18455 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:28:00,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46397 Valid, 18455 Invalid, 3526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [672 Valid, 2854 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-11 16:28:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16936 states. [2024-10-11 16:28:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16936 to 10528. [2024-10-11 16:28:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10528 states, 10398 states have (on average 1.4147913060203885) internal successors, (14711), 10414 states have internal predecessors, (14711), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-11 16:28:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10528 states to 10528 states and 14963 transitions. [2024-10-11 16:28:00,572 INFO L78 Accepts]: Start accepts. Automaton has 10528 states and 14963 transitions. Word has length 671 [2024-10-11 16:28:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:28:00,573 INFO L471 AbstractCegarLoop]: Abstraction has 10528 states and 14963 transitions. [2024-10-11 16:28:00,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 16:28:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 10528 states and 14963 transitions. [2024-10-11 16:28:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2024-10-11 16:28:00,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:28:00,644 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:00,670 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:28:00,845 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,SelfDestructingSolverStorable8 [2024-10-11 16:28:00,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:28:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:28:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1661983493, now seen corresponding path program 1 times [2024-10-11 16:28:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:28:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304630257] [2024-10-11 16:28:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:28:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms