./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.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 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:52:19,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:52:19,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:52:19,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:52:19,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:52:19,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:52:19,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:52:19,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:52:19,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:52:19,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:52:19,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:52:19,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:52:19,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:52:19,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:52:19,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:52:19,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:52:19,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:52:19,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:52:19,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:52:19,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:52:19,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:52:19,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:52:19,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:52:19,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:52:19,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:52:19,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:52:19,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:52:19,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:52:19,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:52:19,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:52:19,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:52:19,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:52:19,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:52:19,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:52:19,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:52:19,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:52:19,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:52:19,458 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 -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2024-11-10 09:52:19,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:52:19,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:52:19,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:52:19,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:52:19,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:52:19,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-10 09:52:21,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:52:21,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:52:21,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-10 09:52:21,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e16576b/1ba6007fd83b4e179fe5e70dfccbed4e/FLAG0e10c9c97 [2024-11-10 09:52:21,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e16576b/1ba6007fd83b4e179fe5e70dfccbed4e [2024-11-10 09:52:21,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:52:21,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:52:21,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:52:21,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:52:21,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:52:21,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:21,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df316fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21, skipping insertion in model container [2024-11-10 09:52:21,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:21,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:52:21,781 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-10 09:52:21,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:52:21,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:52:21,895 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-10 09:52:21,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:52:21,982 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:52:21,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21 WrapperNode [2024-11-10 09:52:21,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:52:21,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:52:21,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:52:21,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:52:21,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,059 INFO L138 Inliner]: procedures = 27, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2024-11-10 09:52:22,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:52:22,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:52:22,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:52:22,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:52:22,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,114 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-10 09:52:22,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:52:22,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:52:22,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:52:22,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:52:22,149 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (1/1) ... [2024-11-10 09:52:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:52:22,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:22,188 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-10 09:52:22,192 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-10 09:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-10 09:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-10 09:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:52:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:52:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:52:22,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:52:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:52:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:52:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:52:22,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:52:22,373 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:52:22,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:52:22,771 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite67#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~ite88#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2024-11-10 09:52:22,824 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-10 09:52:22,824 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:52:22,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:52:22,849 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:52:22,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:52:22 BoogieIcfgContainer [2024-11-10 09:52:22,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:52:22,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:52:22,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:52:22,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:52:22,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:52:21" (1/3) ... [2024-11-10 09:52:22,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a87fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:52:22, skipping insertion in model container [2024-11-10 09:52:22,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:52:21" (2/3) ... [2024-11-10 09:52:22,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a87fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:52:22, skipping insertion in model container [2024-11-10 09:52:22,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:52:22" (3/3) ... [2024-11-10 09:52:22,862 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2024-11-10 09:52:22,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:52:22,880 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:52:22,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:52:22,956 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;@510783b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:52:22,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:52:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 74 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:52:22,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:22,975 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:22,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:22,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1831517804, now seen corresponding path program 1 times [2024-11-10 09:52:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000584160] [2024-11-10 09:52:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000584160] [2024-11-10 09:52:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000584160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:23,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:52:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423127236] [2024-11-10 09:52:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:23,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:52:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:52:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:52:23,439 INFO L87 Difference]: Start difference. First operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 74 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:23,507 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2024-11-10 09:52:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:52:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-10 09:52:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:23,526 INFO L225 Difference]: With dead ends: 172 [2024-11-10 09:52:23,527 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 09:52:23,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10 09:52:23,536 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:52:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 09:52:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 09:52:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-10 09:52:23,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 113 [2024-11-10 09:52:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-10 09:52:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-10 09:52:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:52:23,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:23,596 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:23,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:52:23,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:23,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1620134074, now seen corresponding path program 1 times [2024-11-10 09:52:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878436142] [2024-11-10 09:52:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878436142] [2024-11-10 09:52:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878436142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:24,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:24,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:52:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340250797] [2024-11-10 09:52:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:52:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:52:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,057 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:24,097 INFO L93 Difference]: Finished difference Result 169 states and 234 transitions. [2024-11-10 09:52:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:52:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-10 09:52:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:24,100 INFO L225 Difference]: With dead ends: 169 [2024-11-10 09:52:24,100 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 09:52:24,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,103 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:24,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:52:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 09:52:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 09:52:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-10 09:52:24,120 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-10 09:52:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:24,122 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-10 09:52:24,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-10 09:52:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:52:24,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:24,125 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:52:24,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1895041693, now seen corresponding path program 1 times [2024-11-10 09:52:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596721051] [2024-11-10 09:52:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596721051] [2024-11-10 09:52:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596721051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:52:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534005520] [2024-11-10 09:52:24,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:24,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:52:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:24,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:52:24,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,367 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:24,417 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-10 09:52:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:52:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-10 09:52:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:24,423 INFO L225 Difference]: With dead ends: 174 [2024-11-10 09:52:24,424 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 09:52:24,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,429 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:24,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:52:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 09:52:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-10 09:52:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-10 09:52:24,445 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 115 [2024-11-10 09:52:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:24,446 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-10 09:52:24,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-10 09:52:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:52:24,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:24,453 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:24,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:52:24,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:24,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1698528188, now seen corresponding path program 1 times [2024-11-10 09:52:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539382668] [2024-11-10 09:52:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539382668] [2024-11-10 09:52:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539382668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:24,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:52:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737616405] [2024-11-10 09:52:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:52:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:52:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,685 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:24,719 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-10 09:52:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:52:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-10 09:52:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:24,723 INFO L225 Difference]: With dead ends: 178 [2024-11-10 09:52:24,723 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 09:52:24,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:52:24,725 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:24,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:52:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 09:52:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-10 09:52:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-10 09:52:24,738 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 115 [2024-11-10 09:52:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:24,743 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-10 09:52:24,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-10 09:52:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:52:24,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:24,744 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:52:24,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:24,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -853628773, now seen corresponding path program 1 times [2024-11-10 09:52:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:24,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982021060] [2024-11-10 09:52:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982021060] [2024-11-10 09:52:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982021060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:25,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629398513] [2024-11-10 09:52:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:25,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:25,526 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:25,967 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2024-11-10 09:52:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-10 09:52:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:25,970 INFO L225 Difference]: With dead ends: 260 [2024-11-10 09:52:25,971 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 09:52:25,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:52:25,974 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:25,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 331 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:52:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 09:52:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2024-11-10 09:52:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:52:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-10 09:52:25,994 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 115 [2024-11-10 09:52:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:25,994 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-10 09:52:25,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-10 09:52:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:52:25,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:25,995 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:52:25,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1965546308, now seen corresponding path program 1 times [2024-11-10 09:52:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545247289] [2024-11-10 09:52:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545247289] [2024-11-10 09:52:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545247289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544540238] [2024-11-10 09:52:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:26,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:26,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:26,424 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:26,692 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2024-11-10 09:52:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-10 09:52:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:26,696 INFO L225 Difference]: With dead ends: 276 [2024-11-10 09:52:26,696 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 09:52:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:26,700 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 70 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:26,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 531 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 09:52:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2024-11-10 09:52:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 148 states have internal predecessors, (190), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 09:52:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2024-11-10 09:52:26,722 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 115 [2024-11-10 09:52:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:26,723 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2024-11-10 09:52:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2024-11-10 09:52:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:52:26,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:26,724 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:26,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:52:26,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:26,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash -256997515, now seen corresponding path program 1 times [2024-11-10 09:52:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897982280] [2024-11-10 09:52:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:28,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897982280] [2024-11-10 09:52:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897982280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:28,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:28,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:52:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567427313] [2024-11-10 09:52:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:28,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:52:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:52:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:52:28,011 INFO L87 Difference]: Start difference. First operand 172 states and 234 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:28,610 INFO L93 Difference]: Finished difference Result 407 states and 544 transitions. [2024-11-10 09:52:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:52:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-10 09:52:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:28,614 INFO L225 Difference]: With dead ends: 407 [2024-11-10 09:52:28,614 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 09:52:28,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:28,616 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 112 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:28,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 659 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:52:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 09:52:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2024-11-10 09:52:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 156 states have internal predecessors, (196), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:52:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-11-10 09:52:28,637 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 116 [2024-11-10 09:52:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-11-10 09:52:28,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-11-10 09:52:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:28,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:28,642 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:28,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:52:28,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -226342530, now seen corresponding path program 1 times [2024-11-10 09:52:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:28,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635287972] [2024-11-10 09:52:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635287972] [2024-11-10 09:52:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635287972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:30,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:30,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:52:30,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953828182] [2024-11-10 09:52:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:30,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:52:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:52:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:30,190 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:30,838 INFO L93 Difference]: Finished difference Result 427 states and 569 transitions. [2024-11-10 09:52:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:52:30,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-10 09:52:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:30,841 INFO L225 Difference]: With dead ends: 427 [2024-11-10 09:52:30,841 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 09:52:30,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:52:30,842 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 54 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:30,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 835 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:52:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 09:52:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 178. [2024-11-10 09:52:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 152 states have internal predecessors, (190), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:52:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2024-11-10 09:52:30,859 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 117 [2024-11-10 09:52:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:30,861 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2024-11-10 09:52:30,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2024-11-10 09:52:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:30,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:30,862 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:52:30,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1092648197, now seen corresponding path program 1 times [2024-11-10 09:52:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003241885] [2024-11-10 09:52:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003241885] [2024-11-10 09:52:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003241885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123009211] [2024-11-10 09:52:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:31,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:31,830 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:32,094 INFO L93 Difference]: Finished difference Result 348 states and 459 transitions. [2024-11-10 09:52:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-10 09:52:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:32,096 INFO L225 Difference]: With dead ends: 348 [2024-11-10 09:52:32,096 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 09:52:32,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:32,097 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 43 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:32,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 337 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 09:52:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2024-11-10 09:52:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 139 states have internal predecessors, (173), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 09:52:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2024-11-10 09:52:32,111 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 117 [2024-11-10 09:52:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2024-11-10 09:52:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2024-11-10 09:52:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:32,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:32,115 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:32,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:52:32,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:32,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1787374508, now seen corresponding path program 1 times [2024-11-10 09:52:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:32,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001046463] [2024-11-10 09:52:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001046463] [2024-11-10 09:52:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001046463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589789647] [2024-11-10 09:52:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:52:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:52:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:32,912 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:33,391 INFO L93 Difference]: Finished difference Result 447 states and 584 transitions. [2024-11-10 09:52:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-10 09:52:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:33,393 INFO L225 Difference]: With dead ends: 447 [2024-11-10 09:52:33,393 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 09:52:33,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:33,395 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 73 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:33,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 473 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:52:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 09:52:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2024-11-10 09:52:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 230 states have (on average 1.2217391304347827) internal successors, (281), 233 states have internal predecessors, (281), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 09:52:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 365 transitions. [2024-11-10 09:52:33,427 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 365 transitions. Word has length 117 [2024-11-10 09:52:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:33,428 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 365 transitions. [2024-11-10 09:52:33,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 365 transitions. [2024-11-10 09:52:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:33,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:33,430 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:52:33,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1758745357, now seen corresponding path program 1 times [2024-11-10 09:52:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059644101] [2024-11-10 09:52:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059644101] [2024-11-10 09:52:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059644101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:34,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:34,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836590720] [2024-11-10 09:52:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:34,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:34,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:34,083 INFO L87 Difference]: Start difference. First operand 281 states and 365 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:34,330 INFO L93 Difference]: Finished difference Result 331 states and 425 transitions. [2024-11-10 09:52:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-10 09:52:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:34,334 INFO L225 Difference]: With dead ends: 331 [2024-11-10 09:52:34,334 INFO L226 Difference]: Without dead ends: 328 [2024-11-10 09:52:34,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:34,335 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:34,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 415 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-10 09:52:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2024-11-10 09:52:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 263 states have (on average 1.193916349809886) internal successors, (314), 267 states have internal predecessors, (314), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 09:52:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 418 transitions. [2024-11-10 09:52:34,363 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 418 transitions. Word has length 117 [2024-11-10 09:52:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:34,363 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 418 transitions. [2024-11-10 09:52:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 418 transitions. [2024-11-10 09:52:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:34,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:34,365 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:34,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:52:34,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -764782453, now seen corresponding path program 1 times [2024-11-10 09:52:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7724619] [2024-11-10 09:52:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7724619] [2024-11-10 09:52:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7724619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:52:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052445164] [2024-11-10 09:52:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:52:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:52:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:52:34,689 INFO L87 Difference]: Start difference. First operand 327 states and 418 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:34,871 INFO L93 Difference]: Finished difference Result 637 states and 807 transitions. [2024-11-10 09:52:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:52:34,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-10 09:52:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:34,874 INFO L225 Difference]: With dead ends: 637 [2024-11-10 09:52:34,874 INFO L226 Difference]: Without dead ends: 339 [2024-11-10 09:52:34,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:34,875 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 71 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:34,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 200 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:52:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-10 09:52:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 247. [2024-11-10 09:52:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 200 states have (on average 1.185) internal successors, (237), 202 states have internal predecessors, (237), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2024-11-10 09:52:34,900 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 117 [2024-11-10 09:52:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:34,901 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2024-11-10 09:52:34,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2024-11-10 09:52:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:52:34,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:34,902 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:52:34,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash -961295958, now seen corresponding path program 1 times [2024-11-10 09:52:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967691488] [2024-11-10 09:52:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967691488] [2024-11-10 09:52:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967691488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:52:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476958996] [2024-11-10 09:52:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:35,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:52:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:52:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:35,243 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:35,546 INFO L93 Difference]: Finished difference Result 608 states and 753 transitions. [2024-11-10 09:52:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:35,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-10 09:52:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:35,551 INFO L225 Difference]: With dead ends: 608 [2024-11-10 09:52:35,551 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 09:52:35,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:52:35,556 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:35,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 793 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 09:52:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 389. [2024-11-10 09:52:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 326 states have (on average 1.1748466257668713) internal successors, (383), 330 states have internal predecessors, (383), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:52:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2024-11-10 09:52:35,596 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 117 [2024-11-10 09:52:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:35,597 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2024-11-10 09:52:35,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2024-11-10 09:52:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 09:52:35,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:35,599 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:35,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:52:35,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:35,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1936451308, now seen corresponding path program 1 times [2024-11-10 09:52:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763780024] [2024-11-10 09:52:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:35,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763780024] [2024-11-10 09:52:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763780024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585504499] [2024-11-10 09:52:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:35,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:52:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:52:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:35,879 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:36,338 INFO L93 Difference]: Finished difference Result 1075 states and 1327 transitions. [2024-11-10 09:52:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-10 09:52:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:36,343 INFO L225 Difference]: With dead ends: 1075 [2024-11-10 09:52:36,343 INFO L226 Difference]: Without dead ends: 719 [2024-11-10 09:52:36,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:52:36,345 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 95 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:36,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 818 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:52:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-10 09:52:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 697. [2024-11-10 09:52:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 584 states have (on average 1.1695205479452055) internal successors, (683), 592 states have internal predecessors, (683), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 78 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-10 09:52:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 855 transitions. [2024-11-10 09:52:36,419 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 855 transitions. Word has length 118 [2024-11-10 09:52:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 855 transitions. [2024-11-10 09:52:36,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 855 transitions. [2024-11-10 09:52:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 09:52:36,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:36,422 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:52:36,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash -143679163, now seen corresponding path program 1 times [2024-11-10 09:52:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633004037] [2024-11-10 09:52:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:52:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633004037] [2024-11-10 09:52:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633004037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:52:36,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067827321] [2024-11-10 09:52:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:36,702 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-10 09:52:36,704 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-10 09:52:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:36,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:52:36,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 09:52:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 09:52:37,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:52:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:52:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067827321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:52:37,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:52:37,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-10 09:52:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273547376] [2024-11-10 09:52:37,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:52:37,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:52:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:52:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:37,263 INFO L87 Difference]: Start difference. First operand 697 states and 855 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:52:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:37,852 INFO L93 Difference]: Finished difference Result 1062 states and 1300 transitions. [2024-11-10 09:52:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:52:37,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 118 [2024-11-10 09:52:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:37,855 INFO L225 Difference]: With dead ends: 1062 [2024-11-10 09:52:37,856 INFO L226 Difference]: Without dead ends: 398 [2024-11-10 09:52:37,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:52:37,858 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 77 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:37,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 310 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:52:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-10 09:52:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 387. [2024-11-10 09:52:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 318 states have (on average 1.1635220125786163) internal successors, (370), 322 states have internal predecessors, (370), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 09:52:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 474 transitions. [2024-11-10 09:52:37,894 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 474 transitions. Word has length 118 [2024-11-10 09:52:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:37,894 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 474 transitions. [2024-11-10 09:52:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:52:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 474 transitions. [2024-11-10 09:52:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 09:52:37,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:37,896 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:37,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:52:38,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 09:52:38,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash -980934705, now seen corresponding path program 1 times [2024-11-10 09:52:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130724396] [2024-11-10 09:52:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130724396] [2024-11-10 09:52:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130724396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329380114] [2024-11-10 09:52:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:52:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:38,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:52:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:38,578 INFO L87 Difference]: Start difference. First operand 387 states and 474 transitions. Second operand has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:38,958 INFO L93 Difference]: Finished difference Result 737 states and 901 transitions. [2024-11-10 09:52:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-10 09:52:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:38,961 INFO L225 Difference]: With dead ends: 737 [2024-11-10 09:52:38,961 INFO L226 Difference]: Without dead ends: 387 [2024-11-10 09:52:38,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:38,962 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:38,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 191 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:52:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-10 09:52:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-10 09:52:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 318 states have (on average 1.1446540880503144) internal successors, (364), 322 states have internal predecessors, (364), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 09:52:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 468 transitions. [2024-11-10 09:52:38,999 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 468 transitions. Word has length 119 [2024-11-10 09:52:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:39,000 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 468 transitions. [2024-11-10 09:52:39,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 468 transitions. [2024-11-10 09:52:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 09:52:39,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:39,001 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:39,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:52:39,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1120617614, now seen corresponding path program 1 times [2024-11-10 09:52:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726136007] [2024-11-10 09:52:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726136007] [2024-11-10 09:52:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726136007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:39,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:39,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884617832] [2024-11-10 09:52:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:52:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:52:39,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:39,823 INFO L87 Difference]: Start difference. First operand 387 states and 468 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:40,326 INFO L93 Difference]: Finished difference Result 754 states and 908 transitions. [2024-11-10 09:52:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-10 09:52:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:40,330 INFO L225 Difference]: With dead ends: 754 [2024-11-10 09:52:40,330 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 09:52:40,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:40,332 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:40,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 413 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:52:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 09:52:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 397. [2024-11-10 09:52:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 328 states have (on average 1.1402439024390243) internal successors, (374), 332 states have internal predecessors, (374), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:52:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 476 transitions. [2024-11-10 09:52:40,397 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 476 transitions. Word has length 121 [2024-11-10 09:52:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:40,398 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 476 transitions. [2024-11-10 09:52:40,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2024-11-10 09:52:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 09:52:40,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:40,400 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:52:40,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1095912475, now seen corresponding path program 1 times [2024-11-10 09:52:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820596586] [2024-11-10 09:52:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:52:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121156381] [2024-11-10 09:52:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:40,531 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-10 09:52:40,532 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-10 09:52:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:40,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 09:52:40,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:40,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:40,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:40,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:40,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:40,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:40,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:52:40,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:52:40,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:40,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:52:41,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:41,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 86 treesize of output 91 [2024-11-10 09:52:41,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:41,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 85 treesize of output 25 [2024-11-10 09:52:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:41,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:52:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820596586] [2024-11-10 09:52:41,286 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:52:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121156381] [2024-11-10 09:52:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121156381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:41,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078826350] [2024-11-10 09:52:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:41,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:41,288 INFO L87 Difference]: Start difference. First operand 397 states and 476 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:42,640 INFO L93 Difference]: Finished difference Result 856 states and 1021 transitions. [2024-11-10 09:52:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:42,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-10 09:52:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:42,645 INFO L225 Difference]: With dead ends: 856 [2024-11-10 09:52:42,645 INFO L226 Difference]: Without dead ends: 496 [2024-11-10 09:52:42,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:42,648 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 109 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:42,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 366 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 09:52:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-10 09:52:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 445. [2024-11-10 09:52:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 376 states have (on average 1.1382978723404256) internal successors, (428), 380 states have internal predecessors, (428), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:52:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 530 transitions. [2024-11-10 09:52:42,695 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 530 transitions. Word has length 122 [2024-11-10 09:52:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:42,696 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 530 transitions. [2024-11-10 09:52:42,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 530 transitions. [2024-11-10 09:52:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 09:52:42,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:42,699 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:42,712 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-10 09:52:42,903 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,SelfDestructingSolverStorable17 [2024-11-10 09:52:42,904 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:42,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -860469906, now seen corresponding path program 1 times [2024-11-10 09:52:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227129545] [2024-11-10 09:52:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:52:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972952432] [2024-11-10 09:52:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:42,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:42,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:42,987 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-10 09:52:42,988 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-10 09:52:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:43,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 09:52:43,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:43,311 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 70 treesize of output 69 [2024-11-10 09:52:43,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 105 [2024-11-10 09:52:43,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:43,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:43,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:52:43,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:43,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:52:43,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:43,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:52:44,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:44,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 90 treesize of output 113 [2024-11-10 09:52:44,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:44,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 104 treesize of output 32 [2024-11-10 09:52:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:44,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:52:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:44,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227129545] [2024-11-10 09:52:44,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:52:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972952432] [2024-11-10 09:52:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972952432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670998494] [2024-11-10 09:52:44,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:44,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:52:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:44,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:52:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:52:44,452 INFO L87 Difference]: Start difference. First operand 445 states and 530 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:47,013 INFO L93 Difference]: Finished difference Result 1176 states and 1390 transitions. [2024-11-10 09:52:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:52:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-10 09:52:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:47,017 INFO L225 Difference]: With dead ends: 1176 [2024-11-10 09:52:47,018 INFO L226 Difference]: Without dead ends: 768 [2024-11-10 09:52:47,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:47,019 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 86 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:47,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 383 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 09:52:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-10 09:52:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 358. [2024-11-10 09:52:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 311 states have (on average 1.1479099678456592) internal successors, (357), 312 states have internal predecessors, (357), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 09:52:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 425 transitions. [2024-11-10 09:52:47,052 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 425 transitions. Word has length 123 [2024-11-10 09:52:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 425 transitions. [2024-11-10 09:52:47,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 425 transitions. [2024-11-10 09:52:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:52:47,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:47,054 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:47,075 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-10 09:52:47,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:47,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1473762979, now seen corresponding path program 1 times [2024-11-10 09:52:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053750800] [2024-11-10 09:52:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:48,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053750800] [2024-11-10 09:52:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053750800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:48,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:48,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:52:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818806652] [2024-11-10 09:52:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:52:48,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:52:48,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:52:48,249 INFO L87 Difference]: Start difference. First operand 358 states and 425 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:48,725 INFO L93 Difference]: Finished difference Result 629 states and 742 transitions. [2024-11-10 09:52:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:52:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-11-10 09:52:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:48,728 INFO L225 Difference]: With dead ends: 629 [2024-11-10 09:52:48,728 INFO L226 Difference]: Without dead ends: 374 [2024-11-10 09:52:48,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:52:48,731 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 60 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:48,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 859 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:52:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-10 09:52:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 370. [2024-11-10 09:52:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 320 states have (on average 1.14375) internal successors, (366), 321 states have internal predecessors, (366), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 438 transitions. [2024-11-10 09:52:48,763 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 438 transitions. Word has length 124 [2024-11-10 09:52:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:48,764 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 438 transitions. [2024-11-10 09:52:48,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:52:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 438 transitions. [2024-11-10 09:52:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:52:48,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:48,766 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:52:48,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash 968204354, now seen corresponding path program 1 times [2024-11-10 09:52:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817286899] [2024-11-10 09:52:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:52:48,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217371841] [2024-11-10 09:52:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:48,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:48,842 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-10 09:52:48,843 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-10 09:52:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:49,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 09:52:49,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:49,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:49,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:49,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:49,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:49,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:52:49,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:49,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:52:49,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:49,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:52:49,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:49,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 75 [2024-11-10 09:52:49,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:49,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 30 [2024-11-10 09:52:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:49,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:52:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817286899] [2024-11-10 09:52:49,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:52:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217371841] [2024-11-10 09:52:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217371841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874941079] [2024-11-10 09:52:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:49,465 INFO L87 Difference]: Start difference. First operand 370 states and 438 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:50,211 INFO L93 Difference]: Finished difference Result 637 states and 749 transitions. [2024-11-10 09:52:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-11-10 09:52:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:50,214 INFO L225 Difference]: With dead ends: 637 [2024-11-10 09:52:50,214 INFO L226 Difference]: Without dead ends: 370 [2024-11-10 09:52:50,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:50,215 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 134 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:50,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 371 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:52:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-10 09:52:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2024-11-10 09:52:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 316 states have (on average 1.139240506329114) internal successors, (360), 317 states have internal predecessors, (360), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 432 transitions. [2024-11-10 09:52:50,248 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 432 transitions. Word has length 124 [2024-11-10 09:52:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:50,249 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 432 transitions. [2024-11-10 09:52:50,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 432 transitions. [2024-11-10 09:52:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:52:50,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:50,251 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:50,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 09:52:50,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:50,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1504782786, now seen corresponding path program 1 times [2024-11-10 09:52:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251128654] [2024-11-10 09:52:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:52:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121610233] [2024-11-10 09:52:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:50,556 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-10 09:52:50,558 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-10 09:52:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:50,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 09:52:50,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:50,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:52:50,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:50,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:52:50,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:50,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:52:50,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:50,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:52:50,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:50,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 77 [2024-11-10 09:52:51,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:51,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 32 [2024-11-10 09:52:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:51,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:52:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251128654] [2024-11-10 09:52:51,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:52:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121610233] [2024-11-10 09:52:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121610233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:52:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139513604] [2024-11-10 09:52:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:52:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:51,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:52:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:52:51,151 INFO L87 Difference]: Start difference. First operand 366 states and 432 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:51,724 INFO L93 Difference]: Finished difference Result 685 states and 803 transitions. [2024-11-10 09:52:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:52:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-11-10 09:52:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:51,730 INFO L225 Difference]: With dead ends: 685 [2024-11-10 09:52:51,730 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 09:52:51,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:51,731 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 138 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:51,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 356 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:52:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 09:52:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 367. [2024-11-10 09:52:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 317 states have (on average 1.138801261829653) internal successors, (361), 318 states have internal predecessors, (361), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 433 transitions. [2024-11-10 09:52:51,767 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 433 transitions. Word has length 124 [2024-11-10 09:52:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:51,767 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 433 transitions. [2024-11-10 09:52:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 433 transitions. [2024-11-10 09:52:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:52:51,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:51,770 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:51,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 09:52:51,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 09:52:51,971 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 999224161, now seen corresponding path program 1 times [2024-11-10 09:52:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90596730] [2024-11-10 09:52:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90596730] [2024-11-10 09:52:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90596730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:52,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:52:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491068756] [2024-11-10 09:52:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:52,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:52:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:52:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:52:52,266 INFO L87 Difference]: Start difference. First operand 367 states and 433 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:52,518 INFO L93 Difference]: Finished difference Result 638 states and 748 transitions. [2024-11-10 09:52:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:52:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-11-10 09:52:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:52,522 INFO L225 Difference]: With dead ends: 638 [2024-11-10 09:52:52,522 INFO L226 Difference]: Without dead ends: 374 [2024-11-10 09:52:52,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:52:52,524 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 56 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:52,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 581 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-10 09:52:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2024-11-10 09:52:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 318 states have (on average 1.1383647798742138) internal successors, (362), 319 states have internal predecessors, (362), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 434 transitions. [2024-11-10 09:52:52,562 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 434 transitions. Word has length 124 [2024-11-10 09:52:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 434 transitions. [2024-11-10 09:52:52,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 434 transitions. [2024-11-10 09:52:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:52:52,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:52,564 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:52:52,564 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1064862992, now seen corresponding path program 1 times [2024-11-10 09:52:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206412785] [2024-11-10 09:52:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206412785] [2024-11-10 09:52:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206412785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:54,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:52:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506150899] [2024-11-10 09:52:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:54,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:52:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:52:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:52:54,161 INFO L87 Difference]: Start difference. First operand 368 states and 434 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:54,909 INFO L93 Difference]: Finished difference Result 748 states and 879 transitions. [2024-11-10 09:52:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:52:54,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2024-11-10 09:52:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:54,913 INFO L225 Difference]: With dead ends: 748 [2024-11-10 09:52:54,913 INFO L226 Difference]: Without dead ends: 478 [2024-11-10 09:52:54,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:52:54,915 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 57 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:54,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 631 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:52:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-10 09:52:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 368. [2024-11-10 09:52:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 318 states have (on average 1.1257861635220126) internal successors, (358), 319 states have internal predecessors, (358), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 430 transitions. [2024-11-10 09:52:54,950 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 430 transitions. Word has length 126 [2024-11-10 09:52:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 430 transitions. [2024-11-10 09:52:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 430 transitions. [2024-11-10 09:52:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:52:54,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:54,952 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:54,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:52:54,952 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:54,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 935610959, now seen corresponding path program 1 times [2024-11-10 09:52:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850413683] [2024-11-10 09:52:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850413683] [2024-11-10 09:52:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850413683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:52:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956675601] [2024-11-10 09:52:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:56,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:52:56,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:56,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:52:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:52:56,267 INFO L87 Difference]: Start difference. First operand 368 states and 430 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:56,862 INFO L93 Difference]: Finished difference Result 744 states and 857 transitions. [2024-11-10 09:52:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:52:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2024-11-10 09:52:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:56,866 INFO L225 Difference]: With dead ends: 744 [2024-11-10 09:52:56,866 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 09:52:56,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:52:56,868 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:56,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 734 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:52:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 09:52:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2024-11-10 09:52:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 318 states have (on average 1.1132075471698113) internal successors, (354), 319 states have internal predecessors, (354), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:52:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 426 transitions. [2024-11-10 09:52:56,907 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 426 transitions. Word has length 126 [2024-11-10 09:52:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:56,908 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 426 transitions. [2024-11-10 09:52:56,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 09:52:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 426 transitions. [2024-11-10 09:52:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:52:56,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:56,909 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:52:56,909 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:56,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1821347501, now seen corresponding path program 1 times [2024-11-10 09:52:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:56,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7906795] [2024-11-10 09:52:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:52:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7906795] [2024-11-10 09:52:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7906795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:52:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:52:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:52:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527838869] [2024-11-10 09:52:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:52:57,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:52:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:52:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:52:57,503 INFO L87 Difference]: Start difference. First operand 368 states and 426 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:52:57,742 INFO L93 Difference]: Finished difference Result 814 states and 938 transitions. [2024-11-10 09:52:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:52:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-10 09:52:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:52:57,746 INFO L225 Difference]: With dead ends: 814 [2024-11-10 09:52:57,746 INFO L226 Difference]: Without dead ends: 541 [2024-11-10 09:52:57,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-10 09:52:57,748 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:52:57,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:52:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-10 09:52:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 536. [2024-11-10 09:52:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 473 states have (on average 1.1183932346723044) internal successors, (529), 476 states have internal predecessors, (529), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 09:52:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 617 transitions. [2024-11-10 09:52:57,800 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 617 transitions. Word has length 130 [2024-11-10 09:52:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:52:57,801 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 617 transitions. [2024-11-10 09:52:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:52:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 617 transitions. [2024-11-10 09:52:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:52:57,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:52:57,802 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:52:57,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:52:57,803 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:52:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:52:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1629147924, now seen corresponding path program 1 times [2024-11-10 09:52:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:52:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718153173] [2024-11-10 09:52:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:52:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:52:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:52:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:52:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:52:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:52:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:52:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:52:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:52:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:52:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:52:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:52:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:52:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:52:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:52:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:52:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:52:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718153173] [2024-11-10 09:52:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718153173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:52:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908295678] [2024-11-10 09:52:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:52:58,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:52:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:52:58,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:52:58,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 09:52:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:52:58,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 09:52:58,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:52:58,837 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 31 treesize of output 15 [2024-11-10 09:52:58,877 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 31 treesize of output 15 [2024-11-10 09:52:58,911 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 31 treesize of output 15 [2024-11-10 09:52:58,950 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 31 treesize of output 15 [2024-11-10 09:52:58,983 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 31 treesize of output 15 [2024-11-10 09:52:59,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:59,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 69 [2024-11-10 09:52:59,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:59,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 72 treesize of output 78 [2024-11-10 09:52:59,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:59,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 78 [2024-11-10 09:52:59,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:59,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 76 treesize of output 96 [2024-11-10 09:52:59,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:52:59,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 81 treesize of output 21 [2024-11-10 09:52:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-10 09:52:59,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:52:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:52:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908295678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:52:59,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:52:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 14 [2024-11-10 09:52:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104046337] [2024-11-10 09:52:59,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:52:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:52:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:52:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:52:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:52:59,563 INFO L87 Difference]: Start difference. First operand 536 states and 617 transitions. Second operand has 14 states, 12 states have (on average 10.25) internal successors, (123), 14 states have internal predecessors, (123), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-10 09:53:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:00,154 INFO L93 Difference]: Finished difference Result 802 states and 911 transitions. [2024-11-10 09:53:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 09:53:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 14 states have internal predecessors, (123), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 130 [2024-11-10 09:53:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:00,157 INFO L225 Difference]: With dead ends: 802 [2024-11-10 09:53:00,157 INFO L226 Difference]: Without dead ends: 255 [2024-11-10 09:53:00,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:53:00,159 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 133 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:00,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 207 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:53:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-10 09:53:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2024-11-10 09:53:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 197 states have internal predecessors, (204), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:53:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 276 transitions. [2024-11-10 09:53:00,198 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 276 transitions. Word has length 130 [2024-11-10 09:53:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:00,198 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 276 transitions. [2024-11-10 09:53:00,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 14 states have internal predecessors, (123), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-10 09:53:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 276 transitions. [2024-11-10 09:53:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 09:53:00,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:00,200 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:00,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 09:53:00,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 09:53:00,405 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 130313645, now seen corresponding path program 1 times [2024-11-10 09:53:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807725443] [2024-11-10 09:53:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:53:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922738409] [2024-11-10 09:53:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:00,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:00,591 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:00,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 09:53:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:01,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 09:53:01,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:01,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:53:01,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:53:01,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:53:01,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 65 treesize of output 82 [2024-11-10 09:53:01,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 70 treesize of output 16 [2024-11-10 09:53:01,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:53:01,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-10 09:53:01,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-10 09:53:01,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 64 [2024-11-10 09:53:01,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 111 [2024-11-10 09:53:01,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:01,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 30 [2024-11-10 09:53:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2024-11-10 09:53:01,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:53:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2024-11-10 09:53:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807725443] [2024-11-10 09:53:02,230 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:53:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922738409] [2024-11-10 09:53:02,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922738409] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:53:02,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:53:02,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-10 09:53:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727680137] [2024-11-10 09:53:02,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:02,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:53:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:53:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:53:02,232 INFO L87 Difference]: Start difference. First operand 249 states and 276 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:53:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:02,839 INFO L93 Difference]: Finished difference Result 423 states and 464 transitions. [2024-11-10 09:53:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:53:02,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 240 [2024-11-10 09:53:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:02,841 INFO L225 Difference]: With dead ends: 423 [2024-11-10 09:53:02,841 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 09:53:02,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:53:02,843 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:02,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 238 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:53:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 09:53:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 09:53:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10 09:53:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 09:53:02,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2024-11-10 09:53:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:02,845 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 09:53:02,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:53:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 09:53:02,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 09:53:02,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:53:02,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 09:53:03,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:03,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:03,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 09:53:30,439 WARN L286 SmtUtils]: Spent 17.80s on a formula simplification. DAG size of input: 184 DAG size of output: 110 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-10 09:53:32,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:53:32,041 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:433) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-10 09:53:32,046 INFO L158 Benchmark]: Toolchain (without parser) took 70512.77ms. Allocated memory was 117.4MB in the beginning and 752.9MB in the end (delta: 635.4MB). Free memory was 47.0MB in the beginning and 619.0MB in the end (delta: -572.0MB). Peak memory consumption was 423.6MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,046 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:53:32,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.03ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 47.0MB in the beginning and 130.7MB in the end (delta: -83.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.06ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,046 INFO L158 Benchmark]: Boogie Preprocessor took 82.61ms. Allocated memory is still 172.0MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,046 INFO L158 Benchmark]: IcfgBuilder took 702.03ms. Allocated memory is still 172.0MB. Free memory was 123.4MB in the beginning and 94.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,047 INFO L158 Benchmark]: TraceAbstraction took 69192.94ms. Allocated memory was 172.0MB in the beginning and 752.9MB in the end (delta: 580.9MB). Free memory was 93.0MB in the beginning and 619.0MB in the end (delta: -526.0MB). Peak memory consumption was 413.5MB. Max. memory is 16.1GB. [2024-11-10 09:53:32,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.03ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 47.0MB in the beginning and 130.7MB in the end (delta: -83.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.06ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.61ms. Allocated memory is still 172.0MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 702.03ms. Allocated memory is still 172.0MB. Free memory was 123.4MB in the beginning and 94.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 69192.94ms. Allocated memory was 172.0MB in the beginning and 752.9MB in the end (delta: 580.9MB). Free memory was 93.0MB in the beginning and 619.0MB in the end (delta: -526.0MB). Peak memory consumption was 413.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 28, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2023 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1991 mSDsluCounter, 12476 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9482 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9071 IncrementalHoareTripleChecker+Invalid, 9326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 2994 mSDtfsCounter, 9071 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2224 SyntacticMatches, 8 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=14, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 4454 NumberOfCodeBlocks, 4454 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4176 ConstructedInterpolants, 0 QuantifiedInterpolants, 20908 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2954 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 33 InterpolantComputations, 26 PerfectInterpolantSequences, 14328/14428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-10 09:53:32,258 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 09:53:32,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:53:34,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:53:34,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:53:34,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:53:34,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:53:34,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:53:34,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:53:34,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:53:34,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:53:34,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:53:34,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:53:34,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:53:34,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:53:34,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:53:34,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:53:34,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:53:34,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:53:34,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:53:34,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:53:34,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:53:34,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:53:34,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:53:34,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:53:34,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:53:34,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:53:34,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:53:34,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:53:34,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:53:34,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:53:34,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:53:34,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:53:34,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:53:34,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:53:34,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:53:34,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:34,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:53:34,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:53:34,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:53:34,476 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:53:34,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:53:34,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:53:34,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:53:34,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:53:34,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:53:34,478 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC