./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_JEN_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:13:00,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:13:00,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:13:00,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:13:00,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:13:00,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:13:00,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:13:00,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:13:00,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:13:00,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:13:00,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:13:00,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:13:00,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:13:00,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:13:00,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:13:00,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:13:00,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:13:00,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:13:00,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:13:00,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:13:00,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:13:00,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:13:00,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:13:00,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:13:00,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:13:00,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:13:00,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:13:00,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:13:00,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:13:00,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:13:00,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:13:00,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:13:00,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:13:00,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:13:00,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:13:00,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:13:00,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:13:00,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:13:00,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:13:00,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:13:00,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:13:00,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:13:00,367 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-09 06:13:00,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:13:00,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:13:00,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:13:00,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:13:00,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:13:00,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 06:13:02,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:13:02,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:13:02,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 06:13:02,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05a68fed/08d47adaee94410b8e495913a747ad43/FLAGbcb338f29 [2024-11-09 06:13:02,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05a68fed/08d47adaee94410b8e495913a747ad43 [2024-11-09 06:13:02,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:13:02,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:13:02,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:02,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:13:02,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:13:02,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:02" (1/1) ... [2024-11-09 06:13:02,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcb652b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:02, skipping insertion in model container [2024-11-09 06:13:02,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:02" (1/1) ... [2024-11-09 06:13:03,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:13:03,588 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_JEN_nondet_test2-2.i[37435,37448] [2024-11-09 06:13:03,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:03,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:13:03,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_JEN_nondet_test2-2.i[37435,37448] [2024-11-09 06:13:03,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:03,854 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:13:03,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03 WrapperNode [2024-11-09 06:13:03,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:03,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:13:03,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:13:03,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:13:03,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:03,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,065 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1443 [2024-11-09 06:13:04,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:13:04,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:13:04,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:13:04,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:13:04,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,227 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [34, 2, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2024-11-09 06:13:04,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:13:04,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:13:04,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:13:04,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:13:04,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (1/1) ... [2024-11-09 06:13:04,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:13:04,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:13:04,338 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-09 06:13:04,346 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-09 06:13:04,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:13:04,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:13:04,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:13:04,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:13:04,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:13:04,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:13:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:13:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:13:04,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:13:04,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:13:04,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:13:04,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:13:04,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:13:04,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:13:06,006 INFO L? ?]: Removed 321 outVars from TransFormulas that were not future-live. [2024-11-09 06:13:06,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:13:06,021 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:13:06,021 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 06:13:06,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:06 BoogieIcfgContainer [2024-11-09 06:13:06,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:13:06,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:13:06,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:13:06,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:13:06,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:13:02" (1/3) ... [2024-11-09 06:13:06,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1c3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:06, skipping insertion in model container [2024-11-09 06:13:06,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:03" (2/3) ... [2024-11-09 06:13:06,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1c3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:06, skipping insertion in model container [2024-11-09 06:13:06,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:06" (3/3) ... [2024-11-09 06:13:06,028 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-2.i [2024-11-09 06:13:06,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:13:06,042 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:13:06,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:13:06,104 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;@2b17ac0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:13:06,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:13:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 395 states have (on average 1.620253164556962) internal successors, (640), 396 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:13:06,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:06,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:06,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:06,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash -271903450, now seen corresponding path program 1 times [2024-11-09 06:13:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:06,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54891685] [2024-11-09 06:13:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:06,305 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-09 06:13:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54891685] [2024-11-09 06:13:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54891685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:13:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90891780] [2024-11-09 06:13:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:06,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:13:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:13:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:13:06,347 INFO L87 Difference]: Start difference. First operand has 401 states, 395 states have (on average 1.620253164556962) internal successors, (640), 396 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-09 06:13:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:06,412 INFO L93 Difference]: Finished difference Result 799 states and 1288 transitions. [2024-11-09 06:13:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:13:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-09 06:13:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:06,424 INFO L225 Difference]: With dead ends: 799 [2024-11-09 06:13:06,425 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 06:13:06,428 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-09 06:13:06,432 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:06,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:13:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 06:13:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-09 06:13:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.453781512605042) internal successors, (519), 357 states have internal predecessors, (519), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 525 transitions. [2024-11-09 06:13:06,493 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 525 transitions. Word has length 11 [2024-11-09 06:13:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 525 transitions. [2024-11-09 06:13:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-09 06:13:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 525 transitions. [2024-11-09 06:13:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:13:06,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:06,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:06,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:13:06,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:06,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1335073267, now seen corresponding path program 1 times [2024-11-09 06:13:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632356183] [2024-11-09 06:13:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:06,832 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-09 06:13:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632356183] [2024-11-09 06:13:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632356183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315287253] [2024-11-09 06:13:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:06,837 INFO L87 Difference]: Start difference. First operand 362 states and 525 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-09 06:13:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:06,957 INFO L93 Difference]: Finished difference Result 479 states and 693 transitions. [2024-11-09 06:13:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:13:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-11-09 06:13:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:06,960 INFO L225 Difference]: With dead ends: 479 [2024-11-09 06:13:06,960 INFO L226 Difference]: Without dead ends: 320 [2024-11-09 06:13:06,961 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-09 06:13:06,962 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:06,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1250 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-09 06:13:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-09 06:13:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.403174603174603) internal successors, (442), 315 states have internal predecessors, (442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2024-11-09 06:13:06,980 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 66 [2024-11-09 06:13:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2024-11-09 06:13:06,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-09 06:13:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2024-11-09 06:13:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:13:06,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:06,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:06,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:13:06,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1779429657, now seen corresponding path program 1 times [2024-11-09 06:13:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303157444] [2024-11-09 06:13:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:07,377 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-09 06:13:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303157444] [2024-11-09 06:13:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303157444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:13:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410861941] [2024-11-09 06:13:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:13:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:13:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:13:07,382 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-09 06:13:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:07,483 INFO L93 Difference]: Finished difference Result 752 states and 1048 transitions. [2024-11-09 06:13:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:13:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2024-11-09 06:13:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:07,486 INFO L225 Difference]: With dead ends: 752 [2024-11-09 06:13:07,486 INFO L226 Difference]: Without dead ends: 632 [2024-11-09 06:13:07,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:13:07,493 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 428 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:07,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-09 06:13:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 322. [2024-11-09 06:13:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 317 states have (on average 1.4006309148264984) internal successors, (444), 317 states have internal predecessors, (444), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions. [2024-11-09 06:13:07,551 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 66 [2024-11-09 06:13:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:07,551 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 450 transitions. [2024-11-09 06:13:07,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-09 06:13:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions. [2024-11-09 06:13:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 06:13:07,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:07,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:13:07,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:13:07,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:07,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash 857389398, now seen corresponding path program 1 times [2024-11-09 06:13:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594073026] [2024-11-09 06:13:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:07,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:07,803 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-09 06:13:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:07,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594073026] [2024-11-09 06:13:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594073026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236157839] [2024-11-09 06:13:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:07,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:07,805 INFO L87 Difference]: Start difference. First operand 322 states and 450 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-09 06:13:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:07,916 INFO L93 Difference]: Finished difference Result 597 states and 829 transitions. [2024-11-09 06:13:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:13:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 142 [2024-11-09 06:13:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:07,918 INFO L225 Difference]: With dead ends: 597 [2024-11-09 06:13:07,922 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 06:13:07,923 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-09 06:13:07,923 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 30 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:07,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1001 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 06:13:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-09 06:13:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 275 states have internal predecessors, (367), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2024-11-09 06:13:07,934 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 142 [2024-11-09 06:13:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2024-11-09 06:13:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-09 06:13:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2024-11-09 06:13:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 06:13:07,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:07,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:13:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:13:07,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -172432950, now seen corresponding path program 1 times [2024-11-09 06:13:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299332689] [2024-11-09 06:13:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:08,057 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-09 06:13:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299332689] [2024-11-09 06:13:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299332689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196875302] [2024-11-09 06:13:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:08,059 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-09 06:13:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:08,117 INFO L93 Difference]: Finished difference Result 738 states and 988 transitions. [2024-11-09 06:13:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 142 [2024-11-09 06:13:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:08,119 INFO L225 Difference]: With dead ends: 738 [2024-11-09 06:13:08,119 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 06:13:08,120 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-09 06:13:08,121 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 178 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:08,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 813 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:13:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 06:13:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2024-11-09 06:13:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.3399122807017543) internal successors, (611), 456 states have internal predecessors, (611), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 617 transitions. [2024-11-09 06:13:08,129 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 617 transitions. Word has length 142 [2024-11-09 06:13:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 617 transitions. [2024-11-09 06:13:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-09 06:13:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 617 transitions. [2024-11-09 06:13:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 06:13:08,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:08,134 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-09 06:13:08,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:13:08,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:08,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 227303843, now seen corresponding path program 1 times [2024-11-09 06:13:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:08,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295841503] [2024-11-09 06:13:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 06:13:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 06:13:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:08,418 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-09 06:13:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295841503] [2024-11-09 06:13:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295841503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689348327] [2024-11-09 06:13:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:08,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:08,425 INFO L87 Difference]: Start difference. First operand 461 states and 617 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 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-09 06:13:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:08,629 INFO L93 Difference]: Finished difference Result 890 states and 1201 transitions. [2024-11-09 06:13:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 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-09 06:13:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:08,634 INFO L225 Difference]: With dead ends: 890 [2024-11-09 06:13:08,635 INFO L226 Difference]: Without dead ends: 464 [2024-11-09 06:13:08,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:08,637 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 3 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:08,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 984 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:13:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-09 06:13:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2024-11-09 06:13:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.3267543859649122) internal successors, (605), 456 states have internal predecessors, (605), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 611 transitions. [2024-11-09 06:13:08,658 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 611 transitions. Word has length 157 [2024-11-09 06:13:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:08,658 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 611 transitions. [2024-11-09 06:13:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 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-09 06:13:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 611 transitions. [2024-11-09 06:13:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 06:13:08,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:08,666 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-09 06:13:08,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:13:08,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash 933900449, now seen corresponding path program 1 times [2024-11-09 06:13:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538810244] [2024-11-09 06:13:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 06:13:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 06:13:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:09,040 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-09 06:13:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538810244] [2024-11-09 06:13:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538810244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:09,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:09,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:13:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077172306] [2024-11-09 06:13:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:09,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:13:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:13:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:13:09,045 INFO L87 Difference]: Start difference. First operand 461 states and 611 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-09 06:13:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:09,509 INFO L93 Difference]: Finished difference Result 912 states and 1215 transitions. [2024-11-09 06:13:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:13:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-09 06:13:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:09,515 INFO L225 Difference]: With dead ends: 912 [2024-11-09 06:13:09,516 INFO L226 Difference]: Without dead ends: 543 [2024-11-09 06:13:09,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:13:09,518 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 921 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:09,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1269 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:13:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-09 06:13:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 367. [2024-11-09 06:13:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.3176795580110496) internal successors, (477), 362 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 483 transitions. [2024-11-09 06:13:09,538 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 483 transitions. Word has length 157 [2024-11-09 06:13:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:09,540 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 483 transitions. [2024-11-09 06:13:09,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-09 06:13:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 483 transitions. [2024-11-09 06:13:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 06:13:09,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:09,542 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] [2024-11-09 06:13:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:13:09,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1074857037, now seen corresponding path program 1 times [2024-11-09 06:13:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255625054] [2024-11-09 06:13:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:09,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 06:13:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 06:13:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:13:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255625054] [2024-11-09 06:13:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255625054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515544367] [2024-11-09 06:13:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:10,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:10,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:13:10,143 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-09 06:13:10,144 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-09 06:13:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:10,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:13:10,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:10,578 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-09 06:13:10,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 06:13:11,442 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-09 06:13:11,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515544367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:13:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-09 06:13:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75623736] [2024-11-09 06:13:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:13:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:11,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:13:11,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:13:11,446 INFO L87 Difference]: Start difference. First operand 367 states and 483 transitions. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 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-09 06:13:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:12,920 INFO L93 Difference]: Finished difference Result 861 states and 1146 transitions. [2024-11-09 06:13:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:13:12,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 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 167 [2024-11-09 06:13:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:12,923 INFO L225 Difference]: With dead ends: 861 [2024-11-09 06:13:12,927 INFO L226 Difference]: Without dead ends: 539 [2024-11-09 06:13:12,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-09 06:13:12,929 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 463 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:12,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2184 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:13:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-09 06:13:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 367. [2024-11-09 06:13:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.3149171270718232) internal successors, (476), 362 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 482 transitions. [2024-11-09 06:13:12,955 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 482 transitions. Word has length 167 [2024-11-09 06:13:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 482 transitions. [2024-11-09 06:13:12,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 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-09 06:13:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 482 transitions. [2024-11-09 06:13:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 06:13:12,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:12,957 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-09 06:13:12,982 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-09 06:13:13,157 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-09 06:13:13,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash -452928430, now seen corresponding path program 1 times [2024-11-09 06:13:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803224320] [2024-11-09 06:13:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:13:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:13:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:13:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803224320] [2024-11-09 06:13:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803224320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317093818] [2024-11-09 06:13:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:13,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:13,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:13:13,789 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-09 06:13:13,794 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-09 06:13:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:14,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:13:14,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:14,126 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-09 06:13:14,556 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-09 06:13:14,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:14,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317093818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:14,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:13:14,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-11-09 06:13:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017693491] [2024-11-09 06:13:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:14,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:13:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:14,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:13:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:13:14,557 INFO L87 Difference]: Start difference. First operand 367 states and 482 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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-09 06:13:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:15,358 INFO L93 Difference]: Finished difference Result 668 states and 879 transitions. [2024-11-09 06:13:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:13:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 168 [2024-11-09 06:13:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:15,361 INFO L225 Difference]: With dead ends: 668 [2024-11-09 06:13:15,361 INFO L226 Difference]: Without dead ends: 551 [2024-11-09 06:13:15,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:13:15,362 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 358 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:15,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2324 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:13:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-09 06:13:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 404. [2024-11-09 06:13:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.2957393483709274) internal successors, (517), 399 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 523 transitions. [2024-11-09 06:13:15,373 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 523 transitions. Word has length 168 [2024-11-09 06:13:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 523 transitions. [2024-11-09 06:13:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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-09 06:13:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 523 transitions. [2024-11-09 06:13:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 06:13:15,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:15,375 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, 1] [2024-11-09 06:13:15,390 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-09 06:13:15,575 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-09 06:13:15,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1111494486, now seen corresponding path program 1 times [2024-11-09 06:13:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361636007] [2024-11-09 06:13:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:13:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:13:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:13:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361636007] [2024-11-09 06:13:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361636007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722433007] [2024-11-09 06:13:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:15,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:13:15,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:13:15,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:13:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:16,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 06:13:16,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:16,469 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-09 06:13:16,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:13:16,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 06:13:16,675 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-09 06:13:17,576 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-09 06:13:17,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:19,925 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-09 06:13:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722433007] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:13:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 14] total 28 [2024-11-09 06:13:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412511055] [2024-11-09 06:13:19,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:13:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:19,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:13:19,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2024-11-09 06:13:19,928 INFO L87 Difference]: Start difference. First operand 404 states and 523 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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-09 06:13:24,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:13:29,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:13:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:30,016 INFO L93 Difference]: Finished difference Result 601 states and 780 transitions. [2024-11-09 06:13:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:13:30,017 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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 169 [2024-11-09 06:13:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:30,019 INFO L225 Difference]: With dead ends: 601 [2024-11-09 06:13:30,019 INFO L226 Difference]: Without dead ends: 484 [2024-11-09 06:13:30,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 06:13:30,021 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 112 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 3296 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1249 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 06:13:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-09 06:13:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 415. [2024-11-09 06:13:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2951219512195122) internal successors, (531), 410 states have internal predecessors, (531), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 537 transitions. [2024-11-09 06:13:30,041 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 537 transitions. Word has length 169 [2024-11-09 06:13:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 537 transitions. [2024-11-09 06:13:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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-09 06:13:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 537 transitions. [2024-11-09 06:13:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 06:13:30,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:30,043 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, 1] [2024-11-09 06:13:30,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:13:30,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:30,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1134084968, now seen corresponding path program 1 times [2024-11-09 06:13:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616460678] [2024-11-09 06:13:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:13:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:13:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:30,460 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-09 06:13:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616460678] [2024-11-09 06:13:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616460678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600061553] [2024-11-09 06:13:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:30,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:30,463 INFO L87 Difference]: Start difference. First operand 415 states and 537 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-09 06:13:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:31,333 INFO L93 Difference]: Finished difference Result 550 states and 717 transitions. [2024-11-09 06:13:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 169 [2024-11-09 06:13:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:31,336 INFO L225 Difference]: With dead ends: 550 [2024-11-09 06:13:31,337 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 06:13:31,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:31,338 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 4 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:31,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 978 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:13:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 06:13:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 415. [2024-11-09 06:13:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2804878048780488) internal successors, (525), 410 states have internal predecessors, (525), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 531 transitions. [2024-11-09 06:13:31,357 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 531 transitions. Word has length 169 [2024-11-09 06:13:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 531 transitions. [2024-11-09 06:13:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-09 06:13:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 531 transitions. [2024-11-09 06:13:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 06:13:31,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:31,360 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, 1] [2024-11-09 06:13:31,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:13:31,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash 225472162, now seen corresponding path program 1 times [2024-11-09 06:13:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:31,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234531231] [2024-11-09 06:13:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:13:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:13:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:31,578 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-09 06:13:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234531231] [2024-11-09 06:13:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234531231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:31,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:13:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990055183] [2024-11-09 06:13:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:31,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:13:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:13:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:13:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:13:31,580 INFO L87 Difference]: Start difference. First operand 415 states and 531 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 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-09 06:13:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:31,902 INFO L93 Difference]: Finished difference Result 533 states and 689 transitions. [2024-11-09 06:13:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:13:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 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 169 [2024-11-09 06:13:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:31,909 INFO L225 Difference]: With dead ends: 533 [2024-11-09 06:13:31,909 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 06:13:31,910 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-09 06:13:31,910 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 12 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:31,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1276 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:13:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 06:13:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2024-11-09 06:13:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.2838874680306904) internal successors, (502), 391 states have internal predecessors, (502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 508 transitions. [2024-11-09 06:13:31,952 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 508 transitions. Word has length 169 [2024-11-09 06:13:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 508 transitions. [2024-11-09 06:13:31,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 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-09 06:13:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 508 transitions. [2024-11-09 06:13:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 06:13:31,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:31,955 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, 1, 1] [2024-11-09 06:13:31,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:13:31,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:13:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 19646586, now seen corresponding path program 1 times [2024-11-09 06:13:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:13:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529788729] [2024-11-09 06:13:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:13:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:13:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:13:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:13:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529788729] [2024-11-09 06:13:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529788729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:32,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270570496] [2024-11-09 06:13:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:13:32,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:13:32,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:13:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:33,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:13:33,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:23,052 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-09 06:14:23,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:14:23,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270570496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:14:23,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:14:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2024-11-09 06:14:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068505610] [2024-11-09 06:14:23,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:14:23,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:14:23,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:14:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:14:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=192, Unknown=13, NotChecked=0, Total=240 [2024-11-09 06:14:23,054 INFO L87 Difference]: Start difference. First operand 396 states and 508 transitions. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 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-09 06:14:25,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:29,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:33,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:35,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]