./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 22:50:43,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 22:50:43,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 22:50:43,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 22:50:43,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 22:50:43,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 22:50:43,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 22:50:43,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 22:50:43,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 22:50:43,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 22:50:43,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 22:50:43,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 22:50:43,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 22:50:43,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 22:50:43,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 22:50:43,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 22:50:43,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 22:50:43,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 22:50:43,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 22:50:43,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 22:50:43,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 22:50:43,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 22:50:43,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 22:50:43,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 22:50:43,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 22:50:43,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 22:50:43,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 22:50:43,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 22:50:43,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 22:50:43,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 22:50:43,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 22:50:43,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 22:50:43,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:50:43,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 22:50:43,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 22:50:43,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 22:50:43,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 22:50:43,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 22:50:43,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 22:50:43,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 22:50:43,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 22:50:43,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 22:50:43,811 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/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/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 -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2024-11-16 22:50:44,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 22:50:44,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 22:50:44,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 22:50:44,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 22:50:44,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 22:50:44,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-16 22:50:45,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 22:50:45,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 22:50:45,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-16 22:50:45,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635422d6c/37544d8401d74d5cb50a681ca0e6ed6d/FLAGa3d09236f [2024-11-16 22:50:46,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635422d6c/37544d8401d74d5cb50a681ca0e6ed6d [2024-11-16 22:50:46,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 22:50:46,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 22:50:46,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 22:50:46,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 22:50:46,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 22:50:46,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:46,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b0433c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46, skipping insertion in model container [2024-11-16 22:50:46,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:46,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 22:50:46,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i[33021,33034] [2024-11-16 22:50:46,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i[44590,44603] [2024-11-16 22:50:46,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:50:46,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 22:50:46,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i[33021,33034] [2024-11-16 22:50:46,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i[44590,44603] [2024-11-16 22:50:46,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:50:46,942 INFO L204 MainTranslator]: Completed translation [2024-11-16 22:50:46,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46 WrapperNode [2024-11-16 22:50:46,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 22:50:46,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 22:50:46,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 22:50:46,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 22:50:46,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:46,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,076 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1581 [2024-11-16 22:50:47,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 22:50:47,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 22:50:47,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 22:50:47,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 22:50:47,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,198 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-16 22:50:47,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 22:50:47,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 22:50:47,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 22:50:47,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 22:50:47,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (1/1) ... [2024-11-16 22:50:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:50:47,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:50:47,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 22:50:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 22:50:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 22:50:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 22:50:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 22:50:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 22:50:47,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 22:50:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 22:50:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 22:50:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 22:50:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 22:50:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 22:50:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 22:50:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 22:50:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 22:50:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 22:50:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 22:50:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 22:50:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 22:50:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 22:50:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 22:50:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 22:50:47,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 22:50:47,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 22:50:47,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 22:50:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 22:50:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 22:50:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 22:50:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 22:50:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 22:50:47,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 22:50:47,647 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 22:50:47,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 22:50:49,002 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 22:50:49,136 INFO L? ?]: Removed 346 outVars from TransFormulas that were not future-live. [2024-11-16 22:50:49,137 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 22:50:49,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 22:50:49,187 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 22:50:49,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:50:49 BoogieIcfgContainer [2024-11-16 22:50:49,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 22:50:49,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 22:50:49,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 22:50:49,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 22:50:49,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:50:46" (1/3) ... [2024-11-16 22:50:49,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de3b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:50:49, skipping insertion in model container [2024-11-16 22:50:49,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:46" (2/3) ... [2024-11-16 22:50:49,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de3b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:50:49, skipping insertion in model container [2024-11-16 22:50:49,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:50:49" (3/3) ... [2024-11-16 22:50:49,199 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-2.i [2024-11-16 22:50:49,214 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 22:50:49,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 22:50:49,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 22:50:49,288 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;@670409b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 22:50:49,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 22:50:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 438 states have (on average 1.6187214611872147) internal successors, (709), 445 states have internal predecessors, (709), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 22:50:49,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:49,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:49,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:49,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1436213773, now seen corresponding path program 1 times [2024-11-16 22:50:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171356055] [2024-11-16 22:50:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:50:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171356055] [2024-11-16 22:50:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171356055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 22:50:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303647995] [2024-11-16 22:50:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 22:50:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 22:50:49,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:50:49,541 INFO L87 Difference]: Start difference. First operand has 451 states, 438 states have (on average 1.6187214611872147) internal successors, (709), 445 states have internal predecessors, (709), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-16 22:50:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:49,708 INFO L93 Difference]: Finished difference Result 900 states and 1453 transitions. [2024-11-16 22:50:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 22:50:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-16 22:50:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:49,725 INFO L225 Difference]: With dead ends: 900 [2024-11-16 22:50:49,726 INFO L226 Difference]: Without dead ends: 412 [2024-11-16 22:50:49,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:50:49,739 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:49,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:50:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-16 22:50:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-16 22:50:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 400 states have (on average 1.4475) internal successors, (579), 406 states have internal predecessors, (579), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 595 transitions. [2024-11-16 22:50:49,818 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 595 transitions. Word has length 9 [2024-11-16 22:50:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 595 transitions. [2024-11-16 22:50:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-16 22:50:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 595 transitions. [2024-11-16 22:50:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 22:50:49,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:49,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:49,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 22:50:49,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:49,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 442512487, now seen corresponding path program 1 times [2024-11-16 22:50:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:49,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205259625] [2024-11-16 22:50:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:50:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205259625] [2024-11-16 22:50:50,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205259625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:50:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594498646] [2024-11-16 22:50:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:50,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:50:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:50:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:50:50,041 INFO L87 Difference]: Start difference. First operand 412 states and 595 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:50,381 INFO L93 Difference]: Finished difference Result 1020 states and 1482 transitions. [2024-11-16 22:50:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:50:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 22:50:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:50,387 INFO L225 Difference]: With dead ends: 1020 [2024-11-16 22:50:50,388 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 22:50:50,389 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-11-16 22:50:50,390 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 564 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:50,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1679 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 22:50:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 22:50:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 414. [2024-11-16 22:50:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 402 states have (on average 1.445273631840796) internal successors, (581), 408 states have internal predecessors, (581), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 597 transitions. [2024-11-16 22:50:50,421 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 597 transitions. Word has length 15 [2024-11-16 22:50:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 597 transitions. [2024-11-16 22:50:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 597 transitions. [2024-11-16 22:50:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 22:50:50,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:50,426 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 22:50:50,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:50,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 964514772, now seen corresponding path program 1 times [2024-11-16 22:50:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794161456] [2024-11-16 22:50:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:50:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794161456] [2024-11-16 22:50:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794161456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:50,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:50:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249044155] [2024-11-16 22:50:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:50:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:50:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:50:50,892 INFO L87 Difference]: Start difference. First operand 414 states and 597 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:51,058 INFO L93 Difference]: Finished difference Result 782 states and 1124 transitions. [2024-11-16 22:50:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:50:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-16 22:50:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:51,062 INFO L225 Difference]: With dead ends: 782 [2024-11-16 22:50:51,063 INFO L226 Difference]: Without dead ends: 372 [2024-11-16 22:50:51,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:50:51,065 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 30 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1360 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:50:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-16 22:50:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-16 22:50:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 360 states have (on average 1.4) internal successors, (504), 366 states have internal predecessors, (504), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 520 transitions. [2024-11-16 22:50:51,085 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 520 transitions. Word has length 92 [2024-11-16 22:50:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:51,086 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 520 transitions. [2024-11-16 22:50:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 520 transitions. [2024-11-16 22:50:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 22:50:51,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:51,092 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:51,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 22:50:51,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:51,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash -460110931, now seen corresponding path program 1 times [2024-11-16 22:50:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922960120] [2024-11-16 22:50:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:50:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922960120] [2024-11-16 22:50:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922960120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 22:50:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807142693] [2024-11-16 22:50:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 22:50:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 22:50:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:50:51,322 INFO L87 Difference]: Start difference. First operand 372 states and 520 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:51,513 INFO L93 Difference]: Finished difference Result 1007 states and 1423 transitions. [2024-11-16 22:50:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 22:50:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-16 22:50:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:51,518 INFO L225 Difference]: With dead ends: 1007 [2024-11-16 22:50:51,518 INFO L226 Difference]: Without dead ends: 639 [2024-11-16 22:50:51,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-16 22:50:51,523 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 311 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:51,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1130 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:50:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-16 22:50:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 621. [2024-11-16 22:50:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 609 states have (on average 1.4154351395730707) internal successors, (862), 615 states have internal predecessors, (862), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 878 transitions. [2024-11-16 22:50:51,546 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 878 transitions. Word has length 92 [2024-11-16 22:50:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 878 transitions. [2024-11-16 22:50:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:50:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 878 transitions. [2024-11-16 22:50:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 22:50:51,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:51,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:51,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 22:50:51,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:51,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash -79954824, now seen corresponding path program 1 times [2024-11-16 22:50:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:51,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840216906] [2024-11-16 22:50:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:50:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:50:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 22:50:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840216906] [2024-11-16 22:50:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840216906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:50:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361834086] [2024-11-16 22:50:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:52,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:50:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:50:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:50:52,056 INFO L87 Difference]: Start difference. First operand 621 states and 878 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:50:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:52,539 INFO L93 Difference]: Finished difference Result 926 states and 1315 transitions. [2024-11-16 22:50:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:50:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2024-11-16 22:50:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:52,545 INFO L225 Difference]: With dead ends: 926 [2024-11-16 22:50:52,545 INFO L226 Difference]: Without dead ends: 905 [2024-11-16 22:50:52,546 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-11-16 22:50:52,547 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 470 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:52,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1823 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 22:50:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-16 22:50:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 623. [2024-11-16 22:50:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 611 states have (on average 1.414075286415712) internal successors, (864), 617 states have internal predecessors, (864), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 880 transitions. [2024-11-16 22:50:52,571 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 880 transitions. Word has length 107 [2024-11-16 22:50:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:52,572 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 880 transitions. [2024-11-16 22:50:52,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:50:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 880 transitions. [2024-11-16 22:50:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:50:52,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:52,574 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 22:50:52,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1723557275, now seen corresponding path program 1 times [2024-11-16 22:50:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187454474] [2024-11-16 22:50:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:50:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:50:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 22:50:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187454474] [2024-11-16 22:50:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187454474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:50:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100062180] [2024-11-16 22:50:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:52,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:50:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:50:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:50:52,943 INFO L87 Difference]: Start difference. First operand 623 states and 880 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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-11-16 22:50:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:53,294 INFO L93 Difference]: Finished difference Result 911 states and 1296 transitions. [2024-11-16 22:50:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:50:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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 157 [2024-11-16 22:50:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:53,299 INFO L225 Difference]: With dead ends: 911 [2024-11-16 22:50:53,299 INFO L226 Difference]: Without dead ends: 542 [2024-11-16 22:50:53,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:50:53,300 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 38 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:53,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1407 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 22:50:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-16 22:50:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2024-11-16 22:50:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 527 states have (on average 1.3472485768500948) internal successors, (710), 533 states have internal predecessors, (710), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 726 transitions. [2024-11-16 22:50:53,314 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 726 transitions. Word has length 157 [2024-11-16 22:50:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:53,315 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 726 transitions. [2024-11-16 22:50:53,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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-11-16 22:50:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 726 transitions. [2024-11-16 22:50:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:50:53,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:53,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 22:50:53,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:53,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash -847734338, now seen corresponding path program 1 times [2024-11-16 22:50:53,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:53,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109696] [2024-11-16 22:50:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:50:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:50:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:50:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109696] [2024-11-16 22:50:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:50:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:50:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:50:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465119858] [2024-11-16 22:50:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:50:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:50:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:50:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:50:53,671 INFO L87 Difference]: Start difference. First operand 539 states and 726 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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-11-16 22:50:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:54,190 INFO L93 Difference]: Finished difference Result 1162 states and 1579 transitions. [2024-11-16 22:50:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:50:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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 157 [2024-11-16 22:50:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:54,195 INFO L225 Difference]: With dead ends: 1162 [2024-11-16 22:50:54,195 INFO L226 Difference]: Without dead ends: 715 [2024-11-16 22:50:54,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:50:54,197 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 858 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:54,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1250 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 22:50:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-16 22:50:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 680. [2024-11-16 22:50:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 668 states have (on average 1.348802395209581) internal successors, (901), 674 states have internal predecessors, (901), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 22:50:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 917 transitions. [2024-11-16 22:50:54,224 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 917 transitions. Word has length 157 [2024-11-16 22:50:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:54,225 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 917 transitions. [2024-11-16 22:50:54,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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-11-16 22:50:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 917 transitions. [2024-11-16 22:50:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 22:50:54,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:54,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:54,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 22:50:54,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:54,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1918558108, now seen corresponding path program 1 times [2024-11-16 22:50:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935830885] [2024-11-16 22:50:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:50:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:50:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:50:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:50:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935830885] [2024-11-16 22:50:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935830885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:50:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426818504] [2024-11-16 22:50:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:54,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:50:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:50:54,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:50:54,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 22:50:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:50:55,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 22:50:55,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:50:55,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:50:55,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 22:50:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:50:55,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:50:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:50:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426818504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:50:55,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:50:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-16 22:50:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951874764] [2024-11-16 22:50:55,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:50:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 22:50:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:50:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 22:50:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-16 22:50:55,944 INFO L87 Difference]: Start difference. First operand 680 states and 917 transitions. Second operand has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:50:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:50:56,878 INFO L93 Difference]: Finished difference Result 2199 states and 2975 transitions. [2024-11-16 22:50:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 22:50:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 168 [2024-11-16 22:50:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:50:56,886 INFO L225 Difference]: With dead ends: 2199 [2024-11-16 22:50:56,887 INFO L226 Difference]: Without dead ends: 1770 [2024-11-16 22:50:56,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 22:50:56,890 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 1595 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 4637 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 22:50:56,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 4637 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 22:50:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-16 22:50:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1032. [2024-11-16 22:50:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1016 states have (on average 1.3415354330708662) internal successors, (1363), 1022 states have internal predecessors, (1363), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 22:50:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1385 transitions. [2024-11-16 22:50:56,925 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1385 transitions. Word has length 168 [2024-11-16 22:50:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:50:56,926 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1385 transitions. [2024-11-16 22:50:56,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:50:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1385 transitions. [2024-11-16 22:50:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-16 22:50:56,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:50:56,933 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:50:56,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 22:50:57,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:50:57,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:50:57,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:50:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash -46904872, now seen corresponding path program 1 times [2024-11-16 22:50:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:50:57,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741532093] [2024-11-16 22:50:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:50:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:50:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:00,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741532093] [2024-11-16 22:51:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741532093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:51:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988442041] [2024-11-16 22:51:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:00,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:00,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:00,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:51:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 22:51:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:01,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 1904 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 22:51:01,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:51:01,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:51:01,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 22:51:01,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 22:51:01,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 22:51:02,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 22:51:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:02,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:51:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988442041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:51:02,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:51:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2024-11-16 22:51:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111600593] [2024-11-16 22:51:02,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:51:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 22:51:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 22:51:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2024-11-16 22:51:02,664 INFO L87 Difference]: Start difference. First operand 1032 states and 1385 transitions. Second operand has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:51:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:04,986 INFO L93 Difference]: Finished difference Result 4335 states and 5879 transitions. [2024-11-16 22:51:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 22:51:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 399 [2024-11-16 22:51:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:05,012 INFO L225 Difference]: With dead ends: 4335 [2024-11-16 22:51:05,013 INFO L226 Difference]: Without dead ends: 3906 [2024-11-16 22:51:05,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 790 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 22:51:05,016 INFO L432 NwaCegarLoop]: 1440 mSDtfsCounter, 5841 mSDsluCounter, 14520 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5881 SdHoareTripleChecker+Valid, 15960 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:05,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5881 Valid, 15960 Invalid, 2228 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [101 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 22:51:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2024-11-16 22:51:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 1908. [2024-11-16 22:51:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1886 states have (on average 1.3366914103923648) internal successors, (2521), 1892 states have internal predecessors, (2521), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 22:51:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2555 transitions. [2024-11-16 22:51:05,079 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2555 transitions. Word has length 399 [2024-11-16 22:51:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:05,080 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2555 transitions. [2024-11-16 22:51:05,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:51:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2555 transitions. [2024-11-16 22:51:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2024-11-16 22:51:05,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:05,100 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:05,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 22:51:05,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 22:51:05,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:05,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash 319645016, now seen corresponding path program 2 times [2024-11-16 22:51:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427713693] [2024-11-16 22:51:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms