./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.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 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:01:43,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:01:44,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 23:01:44,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:01:44,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:01:44,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:01:44,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:01:44,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:01:44,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:01:44,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:01:44,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:01:44,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:01:44,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:01:44,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:01:44,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:01:44,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:01:44,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:01:44,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:01:44,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:01:44,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:01:44,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:01:44,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:01:44,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:01:44,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:01:44,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:01:44,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:01:44,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:01:44,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:01:44,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:01:44,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:01:44,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:01:44,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:01:44,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:01:44,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:01:44,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:01:44,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:01:44,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:01:44,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:01:44,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:01:44,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:01:44,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:01:44,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:01:44,050 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 -> 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 [2024-11-16 23:01:44,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:01:44,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:01:44,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:01:44,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:01:44,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:01:44,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2024-11-16 23:01:45,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:01:45,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:01:45,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2024-11-16 23:01:45,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5630bfb9c/cd734d041f564bc185582c4108a20e71/FLAG1c303ba3a [2024-11-16 23:01:45,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5630bfb9c/cd734d041f564bc185582c4108a20e71 [2024-11-16 23:01:45,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:01:45,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:01:45,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:01:45,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:01:45,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:01:45,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:01:45" (1/1) ... [2024-11-16 23:01:45,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9ed84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:45, skipping insertion in model container [2024-11-16 23:01:45,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:01:45" (1/1) ... [2024-11-16 23:01:45,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:01:46,207 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_OAT_test7-1.i[33021,33034] [2024-11-16 23:01:46,349 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_OAT_test7-1.i[44124,44137] [2024-11-16 23:01:46,349 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_OAT_test7-1.i[44245,44258] [2024-11-16 23:01:46,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:01:46,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:01:46,396 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_OAT_test7-1.i[33021,33034] [2024-11-16 23:01:46,450 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_OAT_test7-1.i[44124,44137] [2024-11-16 23:01:46,454 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_OAT_test7-1.i[44245,44258] [2024-11-16 23:01:46,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:01:46,487 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:01:46,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46 WrapperNode [2024-11-16 23:01:46,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:01:46,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:01:46,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:01:46,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:01:46,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,580 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1388 [2024-11-16 23:01:46,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:01:46,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:01:46,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:01:46,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:01:46,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,667 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-16 23:01:46,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:01:46,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:01:46,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:01:46,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:01:46,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (1/1) ... [2024-11-16 23:01:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:01:46,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:01:46,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:01:46,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 23:01:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 23:01:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 23:01:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 23:01:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 23:01:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 23:01:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 23:01:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:01:46,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:01:46,960 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:01:46,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:01:47,977 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 23:01:48,050 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-16 23:01:48,050 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:01:48,099 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:01:48,099 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 23:01:48,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:01:48 BoogieIcfgContainer [2024-11-16 23:01:48,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:01:48,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:01:48,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:01:48,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:01:48,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:01:45" (1/3) ... [2024-11-16 23:01:48,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c90cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:01:48, skipping insertion in model container [2024-11-16 23:01:48,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:01:46" (2/3) ... [2024-11-16 23:01:48,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c90cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:01:48, skipping insertion in model container [2024-11-16 23:01:48,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:01:48" (3/3) ... [2024-11-16 23:01:48,107 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-1.i [2024-11-16 23:01:48,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:01:48,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:01:48,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:01:48,221 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;@576f8fc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:01:48,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:01:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 394 states have (on average 1.616751269035533) internal successors, (637), 396 states have internal predecessors, (637), 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-16 23:01:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 23:01:48,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:48,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:48,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 288116022, now seen corresponding path program 1 times [2024-11-16 23:01:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611717597] [2024-11-16 23:01:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:01:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611717597] [2024-11-16 23:01:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611717597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:48,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:01:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850674986] [2024-11-16 23:01:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:48,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:01:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:01:48,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:01:48,402 INFO L87 Difference]: Start difference. First operand has 401 states, 394 states have (on average 1.616751269035533) internal successors, (637), 396 states have internal predecessors, (637), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:48,518 INFO L93 Difference]: Finished difference Result 799 states and 1283 transitions. [2024-11-16 23:01:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:01:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 23:01:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:48,532 INFO L225 Difference]: With dead ends: 799 [2024-11-16 23:01:48,532 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 23:01:48,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:01:48,541 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:48,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:01:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 23:01:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 23:01:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.4435897435897436) internal successors, (563), 391 states have internal predecessors, (563), 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-16 23:01:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 569 transitions. [2024-11-16 23:01:48,604 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 569 transitions. Word has length 9 [2024-11-16 23:01:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:48,605 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 569 transitions. [2024-11-16 23:01:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 569 transitions. [2024-11-16 23:01:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 23:01:48,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:48,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:01:48,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 357719359, now seen corresponding path program 1 times [2024-11-16 23:01:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169130356] [2024-11-16 23:01:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:01:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:48,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169130356] [2024-11-16 23:01:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169130356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:48,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:01:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547017903] [2024-11-16 23:01:48,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:48,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:01:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:01:48,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:01:48,785 INFO L87 Difference]: Start difference. First operand 396 states and 569 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 23:01:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:49,040 INFO L93 Difference]: Finished difference Result 978 states and 1409 transitions. [2024-11-16 23:01:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:01:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 23:01:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:49,044 INFO L225 Difference]: With dead ends: 978 [2024-11-16 23:01:49,045 INFO L226 Difference]: Without dead ends: 785 [2024-11-16 23:01:49,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:01:49,047 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 553 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:49,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1518 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 23:01:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-16 23:01:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 398. [2024-11-16 23:01:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.441326530612245) internal successors, (565), 393 states have internal predecessors, (565), 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-16 23:01:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 571 transitions. [2024-11-16 23:01:49,085 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 571 transitions. Word has length 11 [2024-11-16 23:01:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:49,085 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 571 transitions. [2024-11-16 23:01:49,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 23:01:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 571 transitions. [2024-11-16 23:01:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 23:01:49,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:49,089 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] [2024-11-16 23:01:49,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:01:49,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:49,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1188118530, now seen corresponding path program 1 times [2024-11-16 23:01:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:49,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587146444] [2024-11-16 23:01:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:01:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:49,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587146444] [2024-11-16 23:01:49,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587146444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:49,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:01:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181801522] [2024-11-16 23:01:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:49,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:01:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:01:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:01:49,526 INFO L87 Difference]: Start difference. First operand 398 states and 571 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:49,690 INFO L93 Difference]: Finished difference Result 750 states and 1072 transitions. [2024-11-16 23:01:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:01:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-16 23:01:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:49,692 INFO L225 Difference]: With dead ends: 750 [2024-11-16 23:01:49,692 INFO L226 Difference]: Without dead ends: 356 [2024-11-16 23:01:49,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:01:49,695 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 12 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:49,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1704 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:01:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-16 23:01:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-16 23:01:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 351 states have internal predecessors, (488), 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-16 23:01:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 494 transitions. [2024-11-16 23:01:49,713 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 494 transitions. Word has length 88 [2024-11-16 23:01:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:49,714 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 494 transitions. [2024-11-16 23:01:49,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 494 transitions. [2024-11-16 23:01:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 23:01:49,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:49,718 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] [2024-11-16 23:01:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:01:49,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:49,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1586768132, now seen corresponding path program 1 times [2024-11-16 23:01:49,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:49,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509861985] [2024-11-16 23:01:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:01:49,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509861985] [2024-11-16 23:01:49,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509861985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:49,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:01:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216318365] [2024-11-16 23:01:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:49,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:01:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:01:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:01:49,846 INFO L87 Difference]: Start difference. First operand 356 states and 494 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:49,998 INFO L93 Difference]: Finished difference Result 961 states and 1347 transitions. [2024-11-16 23:01:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:01:49,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2024-11-16 23:01:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:50,001 INFO L225 Difference]: With dead ends: 961 [2024-11-16 23:01:50,001 INFO L226 Difference]: Without dead ends: 609 [2024-11-16 23:01:50,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:01:50,005 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 296 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:50,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1051 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:01:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-16 23:01:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2024-11-16 23:01:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 599 states have (on average 1.4123539232053421) internal successors, (846), 600 states have internal predecessors, (846), 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-16 23:01:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 852 transitions. [2024-11-16 23:01:50,020 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 852 transitions. Word has length 88 [2024-11-16 23:01:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 852 transitions. [2024-11-16 23:01:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:01:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 852 transitions. [2024-11-16 23:01:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 23:01:50,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:50,023 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] [2024-11-16 23:01:50,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:01:50,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:50,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1300517392, now seen corresponding path program 1 times [2024-11-16 23:01:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942656570] [2024-11-16 23:01:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:01:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:01:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 23:01:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942656570] [2024-11-16 23:01:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942656570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:50,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:01:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973166109] [2024-11-16 23:01:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:01:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:50,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:01:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:01:50,380 INFO L87 Difference]: Start difference. First operand 605 states and 852 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:01:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:50,729 INFO L93 Difference]: Finished difference Result 894 states and 1263 transitions. [2024-11-16 23:01:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:01:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 103 [2024-11-16 23:01:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:50,736 INFO L225 Difference]: With dead ends: 894 [2024-11-16 23:01:50,737 INFO L226 Difference]: Without dead ends: 889 [2024-11-16 23:01:50,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:01:50,740 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 465 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:50,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1656 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 23:01:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-16 23:01:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 607. [2024-11-16 23:01:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 601 states have (on average 1.410981697171381) internal successors, (848), 602 states have internal predecessors, (848), 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-16 23:01:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 854 transitions. [2024-11-16 23:01:50,758 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 854 transitions. Word has length 103 [2024-11-16 23:01:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:50,758 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 854 transitions. [2024-11-16 23:01:50,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:01:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 854 transitions. [2024-11-16 23:01:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 23:01:50,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:50,761 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:50,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:01:50,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1907586606, now seen corresponding path program 1 times [2024-11-16 23:01:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256812673] [2024-11-16 23:01:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:01:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:01:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 23:01:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256812673] [2024-11-16 23:01:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256812673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:51,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:01:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300392879] [2024-11-16 23:01:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:51,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:01:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:01:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:01:51,052 INFO L87 Difference]: Start difference. First operand 607 states and 854 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:01:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:51,316 INFO L93 Difference]: Finished difference Result 879 states and 1244 transitions. [2024-11-16 23:01:51,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:01:51,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-16 23:01:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:51,319 INFO L225 Difference]: With dead ends: 879 [2024-11-16 23:01:51,319 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 23:01:51,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:01:51,320 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 33 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:51,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 23:01:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 23:01:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2024-11-16 23:01:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 517 states have (on average 1.3423597678916828) internal successors, (694), 518 states have internal predecessors, (694), 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-16 23:01:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 700 transitions. [2024-11-16 23:01:51,331 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 700 transitions. Word has length 157 [2024-11-16 23:01:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:51,331 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 700 transitions. [2024-11-16 23:01:51,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:01:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 700 transitions. [2024-11-16 23:01:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 23:01:51,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:51,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:01:51,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:51,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1511557753, now seen corresponding path program 1 times [2024-11-16 23:01:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251580884] [2024-11-16 23:01:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:01:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:01:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:51,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251580884] [2024-11-16 23:01:51,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251580884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:01:51,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:01:51,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 23:01:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602869966] [2024-11-16 23:01:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:01:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:01:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:01:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:01:51,591 INFO L87 Difference]: Start difference. First operand 523 states and 700 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-16 23:01:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:52,188 INFO L93 Difference]: Finished difference Result 1310 states and 1757 transitions. [2024-11-16 23:01:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:01:52,189 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-16 23:01:52,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:52,193 INFO L225 Difference]: With dead ends: 1310 [2024-11-16 23:01:52,194 INFO L226 Difference]: Without dead ends: 879 [2024-11-16 23:01:52,195 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-16 23:01:52,196 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1268 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:52,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1503 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 23:01:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-16 23:01:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 664. [2024-11-16 23:01:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 658 states have (on average 1.344984802431611) internal successors, (885), 659 states have internal predecessors, (885), 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-16 23:01:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 891 transitions. [2024-11-16 23:01:52,214 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 891 transitions. Word has length 157 [2024-11-16 23:01:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 891 transitions. [2024-11-16 23:01:52,215 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-16 23:01:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 891 transitions. [2024-11-16 23:01:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 23:01:52,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:52,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:01:52,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -922536388, now seen corresponding path program 1 times [2024-11-16 23:01:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306954142] [2024-11-16 23:01:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:01:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:01:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306954142] [2024-11-16 23:01:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306954142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:01:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249417206] [2024-11-16 23:01:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:01:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:01:52,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:01:52,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 23:01:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:53,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 23:01:53,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:01:53,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 23:01:53,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:01:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:53,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:01:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249417206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:01:53,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:01:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-16 23:01:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968432960] [2024-11-16 23:01:53,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:01:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 23:01:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 23:01:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-16 23:01:53,571 INFO L87 Difference]: Start difference. First operand 664 states and 891 transitions. Second operand has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:01:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:01:54,352 INFO L93 Difference]: Finished difference Result 2977 states and 4010 transitions. [2024-11-16 23:01:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 23:01:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 168 [2024-11-16 23:01:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:01:54,360 INFO L225 Difference]: With dead ends: 2977 [2024-11-16 23:01:54,361 INFO L226 Difference]: Without dead ends: 2564 [2024-11-16 23:01:54,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 23:01:54,363 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 1667 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 4137 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 23:01:54,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 4137 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 23:01:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-16 23:01:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1016. [2024-11-16 23:01:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1006 states have (on average 1.3389662027833003) internal successors, (1347), 1007 states have internal predecessors, (1347), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 23:01:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1359 transitions. [2024-11-16 23:01:54,403 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1359 transitions. Word has length 168 [2024-11-16 23:01:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:01:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1359 transitions. [2024-11-16 23:01:54,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:01:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1359 transitions. [2024-11-16 23:01:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-16 23:01:54,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:01:54,408 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:01:54,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 23:01:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:01:54,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:01:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:01:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 324625793, now seen corresponding path program 1 times [2024-11-16 23:01:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:01:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510795076] [2024-11-16 23:01:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:01:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:01:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:01:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:01:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510795076] [2024-11-16 23:01:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510795076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:01:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611182535] [2024-11-16 23:01:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:01:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:01:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:01:57,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:01:57,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 23:01:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:01:57,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 23:01:57,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:01:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 23:01:58,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:01:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:01:58,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:01:58,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:01:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:58,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:01:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:01:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611182535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:01:58,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:01:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2024-11-16 23:01:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757990143] [2024-11-16 23:01:58,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:01:58,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 23:01:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:01:58,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 23:01:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2024-11-16 23:01:58,848 INFO L87 Difference]: Start difference. First operand 1016 states and 1359 transitions. Second operand has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:02:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:02:00,842 INFO L93 Difference]: Finished difference Result 6313 states and 8513 transitions. [2024-11-16 23:02:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 23:02:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 399 [2024-11-16 23:02:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:02:00,862 INFO L225 Difference]: With dead ends: 6313 [2024-11-16 23:02:00,862 INFO L226 Difference]: Without dead ends: 5900 [2024-11-16 23:02:00,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 790 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 23:02:00,867 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 8899 mSDsluCounter, 14673 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8919 SdHoareTripleChecker+Valid, 16420 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 23:02:00,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8919 Valid, 16420 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 23:02:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2024-11-16 23:02:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 1892. [2024-11-16 23:02:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1876 states have (on average 1.3352878464818763) internal successors, (2505), 1877 states have internal predecessors, (2505), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 23:02:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2529 transitions. [2024-11-16 23:02:00,979 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2529 transitions. Word has length 399 [2024-11-16 23:02:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:02:00,980 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2529 transitions. [2024-11-16 23:02:00,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:02:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2529 transitions. [2024-11-16 23:02:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2024-11-16 23:02:01,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:02:01,005 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:02:01,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 23:02:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 23:02:01,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:02:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:02:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 457717025, now seen corresponding path program 2 times [2024-11-16 23:02:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:02:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777176566] [2024-11-16 23:02:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:02:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:02:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:02:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:02:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:02:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:02:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777176566] [2024-11-16 23:02:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777176566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:02:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56204755] [2024-11-16 23:02:09,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:02:09,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:02:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:02:09,888 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-16 23:02:09,889 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-16 23:02:10,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:02:10,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:02:10,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 23:02:10,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:02:10,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 23:02:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3471 trivial. 0 not checked. [2024-11-16 23:02:11,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:02:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56204755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:02:11,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:02:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-11-16 23:02:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268549705] [2024-11-16 23:02:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:02:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:02:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:02:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:02:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-16 23:02:11,087 INFO L87 Difference]: Start difference. First operand 1892 states and 2529 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:02:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:02:11,810 INFO L93 Difference]: Finished difference Result 2484 states and 3320 transitions. [2024-11-16 23:02:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:02:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 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 861 [2024-11-16 23:02:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:02:11,818 INFO L225 Difference]: With dead ends: 2484 [2024-11-16 23:02:11,818 INFO L226 Difference]: Without dead ends: 2074 [2024-11-16 23:02:11,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 23:02:11,820 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 399 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 23:02:11,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2194 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 23:02:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-16 23:02:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1928. [2024-11-16 23:02:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1912 states have (on average 1.3310669456066946) internal successors, (2545), 1913 states have internal predecessors, (2545), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 23:02:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2569 transitions. [2024-11-16 23:02:11,864 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2569 transitions. Word has length 861 [2024-11-16 23:02:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:02:11,866 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2569 transitions. [2024-11-16 23:02:11,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:02:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2569 transitions. [2024-11-16 23:02:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-11-16 23:02:11,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:02:11,872 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:02:11,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 23:02:12,075 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-16 23:02:12,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:02:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:02:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash 434936747, now seen corresponding path program 1 times [2024-11-16 23:02:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:02:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459560150] [2024-11-16 23:02:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:02:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:02:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:02:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:02:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:02:20,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:02:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459560150] [2024-11-16 23:02:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459560150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:02:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149397027] [2024-11-16 23:02:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:02:20,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:02:20,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:02:20,544 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-16 23:02:20,545 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-16 23:02:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:02:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 4171 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 23:02:21,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:02:21,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 23:02:21,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:21,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:21,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 23:02:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:02:22,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:02:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:02:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149397027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:02:23,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:02:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 43 [2024-11-16 23:02:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549661212] [2024-11-16 23:02:23,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:02:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-16 23:02:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:02:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-16 23:02:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2024-11-16 23:02:23,438 INFO L87 Difference]: Start difference. First operand 1928 states and 2569 transitions. Second operand has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:02:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:02:27,858 INFO L93 Difference]: Finished difference Result 13021 states and 17558 transitions. [2024-11-16 23:02:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-16 23:02:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 862 [2024-11-16 23:02:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:02:27,895 INFO L225 Difference]: With dead ends: 13021 [2024-11-16 23:02:27,898 INFO L226 Difference]: Without dead ends: 12572 [2024-11-16 23:02:27,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1771 GetRequests, 1705 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=3026, Unknown=0, NotChecked=0, Total=4160 [2024-11-16 23:02:27,902 INFO L432 NwaCegarLoop]: 3834 mSDtfsCounter, 15470 mSDsluCounter, 56546 mSDsCounter, 0 mSdLazyCounter, 7085 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15514 SdHoareTripleChecker+Valid, 60380 SdHoareTripleChecker+Invalid, 7209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 7085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 23:02:27,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15514 Valid, 60380 Invalid, 7209 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 7085 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 23:02:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2024-11-16 23:02:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 3680. [2024-11-16 23:02:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3652 states have (on average 1.3310514786418401) internal successors, (4861), 3653 states have internal predecessors, (4861), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 23:02:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4909 transitions. [2024-11-16 23:02:28,026 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4909 transitions. Word has length 862 [2024-11-16 23:02:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:02:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 4909 transitions. [2024-11-16 23:02:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 23:02:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4909 transitions. [2024-11-16 23:02:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2024-11-16 23:02:28,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:02:28,046 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2024-11-16 23:02:28,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 23:02:28,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:02:28,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 23:02:28,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:02:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1095003243, now seen corresponding path program 2 times [2024-11-16 23:02:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:02:28,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870250880] [2024-11-16 23:02:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:02:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:02:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:03:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 23:03:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:03:03,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 23:03:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:03:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 17793 backedges. 0 proven. 17789 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:03:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:03:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870250880] [2024-11-16 23:03:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870250880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:03:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510251831] [2024-11-16 23:03:03,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:03:03,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:03:03,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:03:03,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:03:03,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 23:03:04,769 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:03:04,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:03:04,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 23:03:04,790 INFO L278 TraceCheckSpWp]: Computing forward predicates...