./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:57:56,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:57:56,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:57:56,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:57:56,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:57:56,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:57:56,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:57:56,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:57:56,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:57:56,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:57:56,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:57:56,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:57:56,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:57:56,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:57:56,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:57:56,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:57:56,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:57:56,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:57:56,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:57:56,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:57:56,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:57:56,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:57:56,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:57:56,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:57:56,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:57:56,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:57:56,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:57:56,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:57:56,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:57:56,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:57:56,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:57:56,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:57:56,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:56,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:57:56,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:57:56,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:57:56,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:57:56,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:57:56,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:57:56,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:57:56,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:57:56,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:57:56,562 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-16 18:57:56,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:57:56,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:57:56,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:57:56,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:57:56,841 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:57:56,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-16 18:57:58,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:57:58,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:57:58,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-16 18:57:58,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f78c5938/a2bf391a9e3c41cc83e1eabf6b766c0d/FLAG513457721 [2024-11-16 18:57:58,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f78c5938/a2bf391a9e3c41cc83e1eabf6b766c0d [2024-11-16 18:57:58,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:57:58,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:57:58,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:58,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:57:58,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:57:58,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa902ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58, skipping insertion in model container [2024-11-16 18:57:58,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:57:58,752 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-sp_file-70.i[917,930] [2024-11-16 18:57:58,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:58,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:57:58,850 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-sp_file-70.i[917,930] [2024-11-16 18:57:58,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:58,903 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:57:58,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58 WrapperNode [2024-11-16 18:57:58,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:58,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:58,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:57:58,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:57:58,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,976 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2024-11-16 18:57:58,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:58,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:57:58,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:57:58,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:57:58,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:58,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,002 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:57:59,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:57:59,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:57:59,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:57:59,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:57:59,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (1/1) ... [2024-11-16 18:57:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:59,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:57:59,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:57:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:57:59,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:57:59,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:57:59,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:57:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:57:59,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:57:59,296 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:57:59,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:57:59,823 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem88#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem113#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~bitwise111#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite137#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2024-11-16 18:57:59,916 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-16 18:57:59,916 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:57:59,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:57:59,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:57:59,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:59 BoogieIcfgContainer [2024-11-16 18:57:59,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:57:59,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:57:59,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:57:59,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:57:59,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:58" (1/3) ... [2024-11-16 18:57:59,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c477d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:59, skipping insertion in model container [2024-11-16 18:57:59,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:58" (2/3) ... [2024-11-16 18:57:59,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c477d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:59, skipping insertion in model container [2024-11-16 18:57:59,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:59" (3/3) ... [2024-11-16 18:57:59,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-16 18:57:59,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:57:59,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:58:00,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:58:00,070 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;@5f1f57d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:58:00,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:58:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 18:58:00,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:00,087 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:00,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:00,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash -649252825, now seen corresponding path program 1 times [2024-11-16 18:58:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176543957] [2024-11-16 18:58:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176543957] [2024-11-16 18:58:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176543957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:58:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150820076] [2024-11-16 18:58:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:58:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:58:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:58:00,977 INFO L87 Difference]: Start difference. First operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:01,042 INFO L93 Difference]: Finished difference Result 222 states and 338 transitions. [2024-11-16 18:58:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:58:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-16 18:58:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:01,053 INFO L225 Difference]: With dead ends: 222 [2024-11-16 18:58:01,054 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:58:01,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-16 18:58:01,060 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:01,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:58:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:58:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-16 18:58:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:58:01,117 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 118 [2024-11-16 18:58:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:01,119 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:58:01,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:58:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:58:01,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:01,124 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:01,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:58:01,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:01,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash -738255959, now seen corresponding path program 1 times [2024-11-16 18:58:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:01,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31959939] [2024-11-16 18:58:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31959939] [2024-11-16 18:58:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31959939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:58:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356201787] [2024-11-16 18:58:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:01,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:58:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:58:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:58:01,428 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:01,481 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-16 18:58:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:58:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:58:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:01,485 INFO L225 Difference]: With dead ends: 222 [2024-11-16 18:58:01,487 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 18:58:01,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-16 18:58:01,489 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:01,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:58:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 18:58:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-16 18:58:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-16 18:58:01,512 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 120 [2024-11-16 18:58:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-16 18:58:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-16 18:58:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:58:01,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:01,519 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:58:01,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1004554376, now seen corresponding path program 1 times [2024-11-16 18:58:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867221938] [2024-11-16 18:58:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867221938] [2024-11-16 18:58:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867221938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:58:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459686542] [2024-11-16 18:58:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:01,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:58:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:58:01,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:58:01,985 INFO L87 Difference]: Start difference. First operand 113 states and 161 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:02,228 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2024-11-16 18:58:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:58:02,228 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:58:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:02,230 INFO L225 Difference]: With dead ends: 240 [2024-11-16 18:58:02,231 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 18:58:02,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:58:02,234 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:02,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 478 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:58:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 18:58:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-16 18:58:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-16 18:58:02,252 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 120 [2024-11-16 18:58:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-16 18:58:02,253 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-16 18:58:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:58:02,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:02,255 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:02,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:58:02,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1997188200, now seen corresponding path program 1 times [2024-11-16 18:58:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045504687] [2024-11-16 18:58:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:03,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045504687] [2024-11-16 18:58:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045504687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:03,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:58:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485720678] [2024-11-16 18:58:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:03,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:58:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:58:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:58:03,203 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:03,592 INFO L93 Difference]: Finished difference Result 281 states and 396 transitions. [2024-11-16 18:58:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:58:03,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:58:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:03,596 INFO L225 Difference]: With dead ends: 281 [2024-11-16 18:58:03,596 INFO L226 Difference]: Without dead ends: 168 [2024-11-16 18:58:03,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:58:03,599 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 294 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:03,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 390 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:58:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-16 18:58:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2024-11-16 18:58:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2024-11-16 18:58:03,624 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 185 transitions. Word has length 120 [2024-11-16 18:58:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:03,625 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 185 transitions. [2024-11-16 18:58:03,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 185 transitions. [2024-11-16 18:58:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:58:03,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:03,628 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:58:03,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:03,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash -827768762, now seen corresponding path program 1 times [2024-11-16 18:58:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875849768] [2024-11-16 18:58:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875849768] [2024-11-16 18:58:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875849768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:58:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661449394] [2024-11-16 18:58:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:58:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:58:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:58:04,035 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:04,277 INFO L93 Difference]: Finished difference Result 295 states and 416 transitions. [2024-11-16 18:58:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:58:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-16 18:58:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:04,280 INFO L225 Difference]: With dead ends: 295 [2024-11-16 18:58:04,280 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 18:58:04,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:58:04,282 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:04,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 471 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:58:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 18:58:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2024-11-16 18:58:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2024-11-16 18:58:04,308 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 121 [2024-11-16 18:58:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2024-11-16 18:58:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2024-11-16 18:58:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:58:04,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:04,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:58:04,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 169248870, now seen corresponding path program 1 times [2024-11-16 18:58:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215266384] [2024-11-16 18:58:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:04,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215266384] [2024-11-16 18:58:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215266384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:04,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:04,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:58:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978220779] [2024-11-16 18:58:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:04,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:58:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:58:04,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:58:04,568 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:04,614 INFO L93 Difference]: Finished difference Result 266 states and 375 transitions. [2024-11-16 18:58:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:58:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-16 18:58:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:04,616 INFO L225 Difference]: With dead ends: 266 [2024-11-16 18:58:04,616 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 18:58:04,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:58:04,618 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:04,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:58:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 18:58:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-16 18:58:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2024-11-16 18:58:04,635 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 121 [2024-11-16 18:58:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2024-11-16 18:58:04,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2024-11-16 18:58:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 18:58:04,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:04,638 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:04,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:58:04,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1361998438, now seen corresponding path program 1 times [2024-11-16 18:58:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891068930] [2024-11-16 18:58:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891068930] [2024-11-16 18:58:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891068930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:58:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739217377] [2024-11-16 18:58:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:58:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:58:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:58:04,979 INFO L87 Difference]: Start difference. First operand 136 states and 190 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:05,232 INFO L93 Difference]: Finished difference Result 269 states and 377 transitions. [2024-11-16 18:58:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:58:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-16 18:58:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:05,234 INFO L225 Difference]: With dead ends: 269 [2024-11-16 18:58:05,234 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 18:58:05,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-16 18:58:05,236 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:05,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:58:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 18:58:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-16 18:58:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-16 18:58:05,244 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 122 [2024-11-16 18:58:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:05,244 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-16 18:58:05,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-16 18:58:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:05,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:05,246 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:05,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:58:05,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 872136395, now seen corresponding path program 1 times [2024-11-16 18:58:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:05,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96436952] [2024-11-16 18:58:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96436952] [2024-11-16 18:58:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96436952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:05,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:05,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:58:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647728506] [2024-11-16 18:58:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:05,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:58:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:58:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:58:05,494 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:05,514 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-11-16 18:58:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:58:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-16 18:58:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:05,516 INFO L225 Difference]: With dead ends: 269 [2024-11-16 18:58:05,516 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 18:58:05,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:58:05,517 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:05,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:58:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 18:58:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-16 18:58:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-11-16 18:58:05,524 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 124 [2024-11-16 18:58:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:05,524 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-11-16 18:58:05,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-11-16 18:58:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:05,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:05,526 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:58:05,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash 463312170, now seen corresponding path program 1 times [2024-11-16 18:58:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:05,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729763748] [2024-11-16 18:58:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:05,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729763748] [2024-11-16 18:58:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729763748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 18:58:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532526885] [2024-11-16 18:58:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:08,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 18:58:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:08,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 18:58:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:58:08,624 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:10,090 INFO L93 Difference]: Finished difference Result 337 states and 459 transitions. [2024-11-16 18:58:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:58:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-16 18:58:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:10,092 INFO L225 Difference]: With dead ends: 337 [2024-11-16 18:58:10,092 INFO L226 Difference]: Without dead ends: 204 [2024-11-16 18:58:10,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:58:10,094 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 420 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:10,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 784 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:58:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-16 18:58:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 159. [2024-11-16 18:58:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 145 states have internal predecessors, (193), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 217 transitions. [2024-11-16 18:58:10,108 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 217 transitions. Word has length 124 [2024-11-16 18:58:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:10,108 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 217 transitions. [2024-11-16 18:58:10,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 217 transitions. [2024-11-16 18:58:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:10,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:10,110 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:10,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:58:10,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1816621867, now seen corresponding path program 1 times [2024-11-16 18:58:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140622719] [2024-11-16 18:58:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140622719] [2024-11-16 18:58:11,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140622719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:11,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:58:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601320507] [2024-11-16 18:58:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:11,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:58:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:58:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:58:11,435 INFO L87 Difference]: Start difference. First operand 159 states and 217 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:12,468 INFO L93 Difference]: Finished difference Result 357 states and 485 transitions. [2024-11-16 18:58:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:58:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-16 18:58:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:12,470 INFO L225 Difference]: With dead ends: 357 [2024-11-16 18:58:12,470 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 18:58:12,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:58:12,471 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 260 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:12,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 886 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:58:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 18:58:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2024-11-16 18:58:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2024-11-16 18:58:12,485 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 124 [2024-11-16 18:58:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2024-11-16 18:58:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2024-11-16 18:58:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:12,487 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:58:12,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1546791671, now seen corresponding path program 1 times [2024-11-16 18:58:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408357257] [2024-11-16 18:58:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408357257] [2024-11-16 18:58:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408357257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:58:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640461086] [2024-11-16 18:58:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:58:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:58:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:58:13,627 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:14,078 INFO L93 Difference]: Finished difference Result 357 states and 483 transitions. [2024-11-16 18:58:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:58:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-16 18:58:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:14,082 INFO L225 Difference]: With dead ends: 357 [2024-11-16 18:58:14,082 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 18:58:14,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:58:14,083 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 248 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:14,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 534 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:58:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 18:58:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2024-11-16 18:58:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 215 transitions. [2024-11-16 18:58:14,100 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 215 transitions. Word has length 124 [2024-11-16 18:58:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 215 transitions. [2024-11-16 18:58:14,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 215 transitions. [2024-11-16 18:58:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:14,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:14,102 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:14,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:58:14,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:14,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -193481974, now seen corresponding path program 1 times [2024-11-16 18:58:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509880189] [2024-11-16 18:58:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509880189] [2024-11-16 18:58:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509880189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:58:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749559264] [2024-11-16 18:58:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:58:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:58:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:58:16,003 INFO L87 Difference]: Start difference. First operand 159 states and 215 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 18:58:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:16,928 INFO L93 Difference]: Finished difference Result 315 states and 427 transitions. [2024-11-16 18:58:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:58:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-16 18:58:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:16,930 INFO L225 Difference]: With dead ends: 315 [2024-11-16 18:58:16,930 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 18:58:16,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:58:16,931 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 339 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:16,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 489 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:58:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 18:58:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-16 18:58:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3125) internal successors, (189), 144 states have internal predecessors, (189), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 213 transitions. [2024-11-16 18:58:16,947 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 213 transitions. Word has length 124 [2024-11-16 18:58:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 213 transitions. [2024-11-16 18:58:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 18:58:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2024-11-16 18:58:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:58:16,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:16,949 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:16,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:58:16,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:16,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash -448218519, now seen corresponding path program 1 times [2024-11-16 18:58:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449294830] [2024-11-16 18:58:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449294830] [2024-11-16 18:58:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449294830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-16 18:58:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416775341] [2024-11-16 18:58:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:58:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:58:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:58:21,479 INFO L87 Difference]: Start difference. First operand 158 states and 213 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 18:58:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:26,459 INFO L93 Difference]: Finished difference Result 412 states and 551 transitions. [2024-11-16 18:58:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 18:58:26,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-16 18:58:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:26,462 INFO L225 Difference]: With dead ends: 412 [2024-11-16 18:58:26,462 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 18:58:26,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 18:58:26,463 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 533 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:26,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1097 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 18:58:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 18:58:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 170. [2024-11-16 18:58:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.314102564102564) internal successors, (205), 156 states have internal predecessors, (205), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-16 18:58:26,477 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 124 [2024-11-16 18:58:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:26,481 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-16 18:58:26,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 18:58:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-16 18:58:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 18:58:26,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:26,482 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:26,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:58:26,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1128375058, now seen corresponding path program 1 times [2024-11-16 18:58:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:26,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934095628] [2024-11-16 18:58:26,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:26,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934095628] [2024-11-16 18:58:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934095628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:58:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319573453] [2024-11-16 18:58:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:58:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:58:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:58:26,836 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:27,249 INFO L93 Difference]: Finished difference Result 354 states and 478 transitions. [2024-11-16 18:58:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:58:27,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-16 18:58:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:27,252 INFO L225 Difference]: With dead ends: 354 [2024-11-16 18:58:27,252 INFO L226 Difference]: Without dead ends: 187 [2024-11-16 18:58:27,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:58:27,253 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 12 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:27,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 600 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:58:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-16 18:58:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-11-16 18:58:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.3) internal successors, (208), 160 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:58:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2024-11-16 18:58:27,266 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 125 [2024-11-16 18:58:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:27,267 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2024-11-16 18:58:27,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:58:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2024-11-16 18:58:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 18:58:27,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:27,268 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:27,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:58:27,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:27,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash -933637086, now seen corresponding path program 1 times [2024-11-16 18:58:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499131836] [2024-11-16 18:58:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:58:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:58:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:58:57,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499131836] [2024-11-16 18:58:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499131836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:58:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:58:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-16 18:58:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886518951] [2024-11-16 18:58:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:58:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 18:58:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 18:58:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:58:57,023 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)