./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.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-15.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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:51:48,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:51:48,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:51:48,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:51:48,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:51:48,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:51:48,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:51:48,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:51:48,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:51:48,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:51:48,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:51:48,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:51:48,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:51:48,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:51:48,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:51:48,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:51:48,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:51:48,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:51:48,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:51:48,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:51:48,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:51:48,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:51:48,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:51:48,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:51:48,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:51:48,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:51:48,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:51:48,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:51:48,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:51:48,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:51:48,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:51:48,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:51:48,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:51:48,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:51:48,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:51:48,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:51:48,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:51:48,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:51:48,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:51:48,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:51:48,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:51:48,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:51:48,971 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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2024-11-16 18:51:49,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:51:49,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:51:49,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:51:49,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:51:49,285 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:51:49,287 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-15.i [2024-11-16 18:51:50,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:51:50,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:51:50,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-16 18:51:50,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcadfc38/e70c4ea627e140158cb08660221319ee/FLAGd3679ff34 [2024-11-16 18:51:51,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcadfc38/e70c4ea627e140158cb08660221319ee [2024-11-16 18:51:51,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:51:51,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:51:51,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:51:51,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:51:51,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:51:51,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c38fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51, skipping insertion in model container [2024-11-16 18:51:51,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:51:51,566 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-15.i[917,930] [2024-11-16 18:51:51,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:51:51,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:51:51,689 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-15.i[917,930] [2024-11-16 18:51:51,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:51:51,770 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:51:51,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51 WrapperNode [2024-11-16 18:51:51,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:51:51,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:51:51,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:51:51,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:51:51,781 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:51:51" (1/1) ... [2024-11-16 18:51:51,798 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:51:51" (1/1) ... [2024-11-16 18:51:51,846 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-16 18:51:51,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:51:51,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:51:51,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:51:51,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:51:51,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,887 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:51:51,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:51:51,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:51:51,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:51:51,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:51:51,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (1/1) ... [2024-11-16 18:51:51,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:51:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:51:51,978 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:51:51,985 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:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:51:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:51:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:51:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:51:52,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:51:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:51:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:51:52,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:51:52,156 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:51:52,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:51:52,676 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2024-11-16 18:51:52,737 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-16 18:51:52,737 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:51:52,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:51:52,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:51:52,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:51:52 BoogieIcfgContainer [2024-11-16 18:51:52,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:51:52,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:51:52,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:51:52,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:51:52,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:51:51" (1/3) ... [2024-11-16 18:51:52,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f084d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:51:52, skipping insertion in model container [2024-11-16 18:51:52,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:51" (2/3) ... [2024-11-16 18:51:52,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f084d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:51:52, skipping insertion in model container [2024-11-16 18:51:52,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:51:52" (3/3) ... [2024-11-16 18:51:52,763 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-16 18:51:52,778 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:51:52,778 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:51:52,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:51:52,843 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;@18ec3bf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:51:52,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:51:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 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:51:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:51:52,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:52,860 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] [2024-11-16 18:51:52,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1791820989, now seen corresponding path program 1 times [2024-11-16 18:51:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:51:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543535585] [2024-11-16 18:51:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:51:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:51:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:51:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:51:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:51:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:51:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:51:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:51:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:51:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:51:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:51:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:51:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:51:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,369 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:51:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:51:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543535585] [2024-11-16 18:51:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543535585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:51:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467994618] [2024-11-16 18:51:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:53,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:51:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:51:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:51:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:51:53,408 INFO L87 Difference]: Start difference. First operand has 116 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 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 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:51:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:53,446 INFO L93 Difference]: Finished difference Result 224 states and 343 transitions. [2024-11-16 18:51:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:51:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 117 [2024-11-16 18:51:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:53,459 INFO L225 Difference]: With dead ends: 224 [2024-11-16 18:51:53,459 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:51:53,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:51:53,469 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:53,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:51:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:51:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-16 18:51:53,505 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:51:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:51:53,510 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 117 [2024-11-16 18:51:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:53,512 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:51:53,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:51:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:51:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:51:53,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:53,521 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] [2024-11-16 18:51:53,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:51:53,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 425936964, now seen corresponding path program 1 times [2024-11-16 18:51:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:51:53,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409684885] [2024-11-16 18:51:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:51:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:51:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:51:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:51:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:51:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:51:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:51:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:51:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:51:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:51:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:51:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:51:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:51:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:53,909 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:51:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:51:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409684885] [2024-11-16 18:51:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409684885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:51:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342140971] [2024-11-16 18:51:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:51:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:51:53,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:51:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:51:53,918 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:51:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:53,955 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2024-11-16 18:51:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:51:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 117 [2024-11-16 18:51:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:53,960 INFO L225 Difference]: With dead ends: 217 [2024-11-16 18:51:53,961 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 18:51:53,962 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:51:53,965 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:53,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:51:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 18:51:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 18:51:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 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:51:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-16 18:51:53,979 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 117 [2024-11-16 18:51:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:53,980 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-16 18:51:53,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:51:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-16 18:51:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:51:53,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:53,983 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] [2024-11-16 18:51:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:51:53,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -385437760, now seen corresponding path program 1 times [2024-11-16 18:51:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:51:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953355350] [2024-11-16 18:51:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:51:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:51:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:51:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:51:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:51:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:51:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:51:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:51:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:51:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:51:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:51:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:51:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:51:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:56,048 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:51:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:51:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953355350] [2024-11-16 18:51:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953355350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:51:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117569464] [2024-11-16 18:51:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:56,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:51:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:51:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:51:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:51:56,052 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:51:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:56,471 INFO L93 Difference]: Finished difference Result 286 states and 411 transitions. [2024-11-16 18:51:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:51:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-16 18:51:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:56,476 INFO L225 Difference]: With dead ends: 286 [2024-11-16 18:51:56,476 INFO L226 Difference]: Without dead ends: 180 [2024-11-16 18:51:56,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:51:56,481 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 151 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:56,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 527 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:51:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-16 18:51:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2024-11-16 18:51:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 144 states have internal predecessors, (196), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:51:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-11-16 18:51:56,536 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 117 [2024-11-16 18:51:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:56,536 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-11-16 18:51:56,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:51:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-11-16 18:51:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 18:51:56,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:56,542 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:51:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:51:56,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1500401318, now seen corresponding path program 1 times [2024-11-16 18:51:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:51:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356025463] [2024-11-16 18:51:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:51:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:51:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:51:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:51:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:51:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:51:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:51:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:51:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:51:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:51:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:51:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:51:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:51:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:58,626 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:51:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:51:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356025463] [2024-11-16 18:51:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356025463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:51:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741461298] [2024-11-16 18:51:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:51:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:51:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:51:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:51:58,630 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:51:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:59,100 INFO L93 Difference]: Finished difference Result 386 states and 552 transitions. [2024-11-16 18:51:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:51:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-16 18:51:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:59,103 INFO L225 Difference]: With dead ends: 386 [2024-11-16 18:51:59,106 INFO L226 Difference]: Without dead ends: 279 [2024-11-16 18:51:59,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:51:59,108 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 207 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:59,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 639 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:51:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-16 18:51:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2024-11-16 18:51:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:51:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 392 transitions. [2024-11-16 18:51:59,143 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 392 transitions. Word has length 118 [2024-11-16 18:51:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:59,144 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 392 transitions. [2024-11-16 18:51:59,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:51:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 392 transitions. [2024-11-16 18:51:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:51:59,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:59,146 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] [2024-11-16 18:51:59,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:51:59,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:59,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1909632254, now seen corresponding path program 1 times [2024-11-16 18:51:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:51:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862481125] [2024-11-16 18:51:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:51:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:51:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:51:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:51:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:00,053 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:52:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862481125] [2024-11-16 18:52:00,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862481125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:00,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:00,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:52:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483991518] [2024-11-16 18:52:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:00,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:52:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:52:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:52:00,056 INFO L87 Difference]: Start difference. First operand 274 states and 392 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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:52:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:00,506 INFO L93 Difference]: Finished difference Result 468 states and 663 transitions. [2024-11-16 18:52:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:52:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 119 [2024-11-16 18:52:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:00,510 INFO L225 Difference]: With dead ends: 468 [2024-11-16 18:52:00,510 INFO L226 Difference]: Without dead ends: 360 [2024-11-16 18:52:00,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:52:00,512 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 168 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:00,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1085 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-16 18:52:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2024-11-16 18:52:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 243 states have internal predecessors, (332), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 404 transitions. [2024-11-16 18:52:00,544 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 404 transitions. Word has length 119 [2024-11-16 18:52:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 404 transitions. [2024-11-16 18:52:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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:52:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 404 transitions. [2024-11-16 18:52:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:52:00,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:00,548 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:52:00,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:52:00,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1495012260, now seen corresponding path program 1 times [2024-11-16 18:52:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870509924] [2024-11-16 18:52:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:01,548 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:52:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870509924] [2024-11-16 18:52:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870509924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:01,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:52:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750850657] [2024-11-16 18:52:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:52:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:52:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:52:01,554 INFO L87 Difference]: Start difference. First operand 283 states and 404 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:52:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:02,028 INFO L93 Difference]: Finished difference Result 507 states and 716 transitions. [2024-11-16 18:52:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:52:02,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:52:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:02,032 INFO L225 Difference]: With dead ends: 507 [2024-11-16 18:52:02,032 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 18:52:02,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:02,035 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 239 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:02,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 606 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 18:52:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 291. [2024-11-16 18:52:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.3705179282868525) internal successors, (344), 251 states have internal predecessors, (344), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 416 transitions. [2024-11-16 18:52:02,080 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 416 transitions. Word has length 120 [2024-11-16 18:52:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:02,080 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 416 transitions. [2024-11-16 18:52:02,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:52:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 416 transitions. [2024-11-16 18:52:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:52:02,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:02,082 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:52:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:52:02,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1706363173, now seen corresponding path program 1 times [2024-11-16 18:52:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177208230] [2024-11-16 18:52:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:04,393 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:52:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177208230] [2024-11-16 18:52:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177208230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:52:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617494667] [2024-11-16 18:52:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:04,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:52:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:52:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:52:04,396 INFO L87 Difference]: Start difference. First operand 291 states and 416 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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) [2024-11-16 18:52:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:05,145 INFO L93 Difference]: Finished difference Result 639 states and 910 transitions. [2024-11-16 18:52:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:52:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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) Word has length 120 [2024-11-16 18:52:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:05,149 INFO L225 Difference]: With dead ends: 639 [2024-11-16 18:52:05,149 INFO L226 Difference]: Without dead ends: 412 [2024-11-16 18:52:05,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:52:05,151 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 341 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:05,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 454 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:52:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-16 18:52:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 325. [2024-11-16 18:52:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 285 states have (on average 1.3789473684210527) internal successors, (393), 285 states have internal predecessors, (393), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 465 transitions. [2024-11-16 18:52:05,195 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 465 transitions. Word has length 120 [2024-11-16 18:52:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:05,196 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 465 transitions. [2024-11-16 18:52:05,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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) [2024-11-16 18:52:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 465 transitions. [2024-11-16 18:52:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:52:05,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:05,198 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:52:05,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:52:05,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:05,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1275399219, now seen corresponding path program 1 times [2024-11-16 18:52:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:05,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928946331] [2024-11-16 18:52:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:05,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:05,773 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:52:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928946331] [2024-11-16 18:52:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928946331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:52:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707242959] [2024-11-16 18:52:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:52:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:52:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:52:05,775 INFO L87 Difference]: Start difference. First operand 325 states and 465 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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:52:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:06,132 INFO L93 Difference]: Finished difference Result 690 states and 977 transitions. [2024-11-16 18:52:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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:52:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:06,136 INFO L225 Difference]: With dead ends: 690 [2024-11-16 18:52:06,136 INFO L226 Difference]: Without dead ends: 433 [2024-11-16 18:52:06,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:06,139 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 212 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:06,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1032 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:52:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-16 18:52:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 364. [2024-11-16 18:52:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 324 states have (on average 1.367283950617284) internal successors, (443), 324 states have internal predecessors, (443), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 515 transitions. [2024-11-16 18:52:06,185 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 515 transitions. Word has length 120 [2024-11-16 18:52:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:06,185 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 515 transitions. [2024-11-16 18:52:06,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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:52:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 515 transitions. [2024-11-16 18:52:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:52:06,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:06,187 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:52:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:52:06,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:06,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1028918198, now seen corresponding path program 1 times [2024-11-16 18:52:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806648890] [2024-11-16 18:52:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:07,403 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:52:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806648890] [2024-11-16 18:52:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806648890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:52:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329281038] [2024-11-16 18:52:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:52:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:52:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:52:07,407 INFO L87 Difference]: Start difference. First operand 364 states and 515 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 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) [2024-11-16 18:52:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:07,910 INFO L93 Difference]: Finished difference Result 533 states and 752 transitions. [2024-11-16 18:52:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 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) Word has length 120 [2024-11-16 18:52:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:07,913 INFO L225 Difference]: With dead ends: 533 [2024-11-16 18:52:07,914 INFO L226 Difference]: Without dead ends: 370 [2024-11-16 18:52:07,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:52:07,915 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 240 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:07,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 437 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-16 18:52:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2024-11-16 18:52:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 322 states have (on average 1.3571428571428572) internal successors, (437), 322 states have internal predecessors, (437), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 509 transitions. [2024-11-16 18:52:07,954 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 509 transitions. Word has length 120 [2024-11-16 18:52:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:07,956 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 509 transitions. [2024-11-16 18:52:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 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) [2024-11-16 18:52:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 509 transitions. [2024-11-16 18:52:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:52:07,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:07,958 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:52:07,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:52:07,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1257615063, now seen corresponding path program 1 times [2024-11-16 18:52:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376379976] [2024-11-16 18:52:07,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:09,369 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:52:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376379976] [2024-11-16 18:52:09,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376379976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:09,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:09,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:52:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68073638] [2024-11-16 18:52:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:09,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:52:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:09,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:52:09,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:52:09,371 INFO L87 Difference]: Start difference. First operand 362 states and 509 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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) [2024-11-16 18:52:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:09,911 INFO L93 Difference]: Finished difference Result 663 states and 929 transitions. [2024-11-16 18:52:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:52:09,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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) Word has length 121 [2024-11-16 18:52:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:09,914 INFO L225 Difference]: With dead ends: 663 [2024-11-16 18:52:09,914 INFO L226 Difference]: Without dead ends: 369 [2024-11-16 18:52:09,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:09,916 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 151 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:09,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 463 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-16 18:52:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 354. [2024-11-16 18:52:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 314 states have (on average 1.3471337579617835) internal successors, (423), 314 states have internal predecessors, (423), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 495 transitions. [2024-11-16 18:52:09,949 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 495 transitions. Word has length 121 [2024-11-16 18:52:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:09,949 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 495 transitions. [2024-11-16 18:52:09,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 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) [2024-11-16 18:52:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 495 transitions. [2024-11-16 18:52:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:52:09,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:09,952 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:52:09,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:52:09,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 883282307, now seen corresponding path program 1 times [2024-11-16 18:52:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556925369] [2024-11-16 18:52:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:10,205 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:52:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556925369] [2024-11-16 18:52:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556925369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:52:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090947256] [2024-11-16 18:52:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:52:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:52:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:52:10,207 INFO L87 Difference]: Start difference. First operand 354 states and 495 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:52:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:10,391 INFO L93 Difference]: Finished difference Result 624 states and 870 transitions. [2024-11-16 18:52:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:52:10,392 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:52:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:10,394 INFO L225 Difference]: With dead ends: 624 [2024-11-16 18:52:10,394 INFO L226 Difference]: Without dead ends: 328 [2024-11-16 18:52:10,395 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:52:10,395 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 9 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:10,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 502 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:52:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-16 18:52:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 316. [2024-11-16 18:52:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 276 states have (on average 1.3333333333333333) internal successors, (368), 276 states have internal predecessors, (368), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2024-11-16 18:52:10,423 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 121 [2024-11-16 18:52:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:10,424 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2024-11-16 18:52:10,424 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:52:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2024-11-16 18:52:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:52:10,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:10,426 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:52:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:52:10,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:10,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash 548360670, now seen corresponding path program 1 times [2024-11-16 18:52:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186568209] [2024-11-16 18:52:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:11,756 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:52:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186568209] [2024-11-16 18:52:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186568209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:52:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194546328] [2024-11-16 18:52:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:52:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:52:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:52:11,759 INFO L87 Difference]: Start difference. First operand 316 states and 440 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:12,450 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2024-11-16 18:52:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-16 18:52:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:12,453 INFO L225 Difference]: With dead ends: 588 [2024-11-16 18:52:12,453 INFO L226 Difference]: Without dead ends: 335 [2024-11-16 18:52:12,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:12,454 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 71 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:12,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 707 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:52:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-16 18:52:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 323. [2024-11-16 18:52:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 447 transitions. [2024-11-16 18:52:12,483 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 447 transitions. Word has length 121 [2024-11-16 18:52:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:12,484 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 447 transitions. [2024-11-16 18:52:12,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 447 transitions. [2024-11-16 18:52:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:52:12,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:12,485 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:52:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:52:12,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:12,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1241462367, now seen corresponding path program 1 times [2024-11-16 18:52:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324786775] [2024-11-16 18:52:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:15,053 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:52:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324786775] [2024-11-16 18:52:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324786775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:15,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:15,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 18:52:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888909396] [2024-11-16 18:52:15,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:52:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:15,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:52:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:15,057 INFO L87 Difference]: Start difference. First operand 323 states and 447 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:16,503 INFO L93 Difference]: Finished difference Result 628 states and 865 transitions. [2024-11-16 18:52:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:52:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-16 18:52:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:16,506 INFO L225 Difference]: With dead ends: 628 [2024-11-16 18:52:16,506 INFO L226 Difference]: Without dead ends: 375 [2024-11-16 18:52:16,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:52:16,507 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 312 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:16,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1105 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:52:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-16 18:52:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 331. [2024-11-16 18:52:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 291 states have (on average 1.3230240549828178) internal successors, (385), 291 states have internal predecessors, (385), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 457 transitions. [2024-11-16 18:52:16,548 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 457 transitions. Word has length 121 [2024-11-16 18:52:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:16,548 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 457 transitions. [2024-11-16 18:52:16,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 457 transitions. [2024-11-16 18:52:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 18:52:16,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:16,552 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:52:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:52:16,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:16,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2146946705, now seen corresponding path program 1 times [2024-11-16 18:52:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343586754] [2024-11-16 18:52:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:18,831 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:52:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343586754] [2024-11-16 18:52:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343586754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:18,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:52:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247302509] [2024-11-16 18:52:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:18,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:52:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:52:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:52:18,833 INFO L87 Difference]: Start difference. First operand 331 states and 457 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:19,929 INFO L93 Difference]: Finished difference Result 669 states and 917 transitions. [2024-11-16 18:52:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-16 18:52:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:19,935 INFO L225 Difference]: With dead ends: 669 [2024-11-16 18:52:19,935 INFO L226 Difference]: Without dead ends: 399 [2024-11-16 18:52:19,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:52:19,937 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 295 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:19,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 882 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:52:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-16 18:52:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 353. [2024-11-16 18:52:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 313 states have (on average 1.31629392971246) internal successors, (412), 313 states have internal predecessors, (412), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 484 transitions. [2024-11-16 18:52:19,968 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 484 transitions. Word has length 122 [2024-11-16 18:52:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:19,969 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 484 transitions. [2024-11-16 18:52:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:52:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 484 transitions. [2024-11-16 18:52:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 18:52:19,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:19,971 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:52:19,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:52:19,971 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2135630578, now seen corresponding path program 1 times [2024-11-16 18:52:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:19,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669576433] [2024-11-16 18:52:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:19,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:23,929 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:52:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669576433] [2024-11-16 18:52:23,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669576433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:23,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:23,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-16 18:52:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390224884] [2024-11-16 18:52:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:23,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:52:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:52:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:52:23,932 INFO L87 Difference]: Start difference. First operand 353 states and 484 transitions. Second operand has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 18:52:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:26,476 INFO L93 Difference]: Finished difference Result 680 states and 927 transitions. [2024-11-16 18:52:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:52:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2024-11-16 18:52:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:26,479 INFO L225 Difference]: With dead ends: 680 [2024-11-16 18:52:26,479 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 18:52:26,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 18:52:26,483 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 628 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:26,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1344 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 18:52:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 18:52:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 345. [2024-11-16 18:52:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 305 states have (on average 1.3147540983606558) internal successors, (401), 305 states have internal predecessors, (401), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 473 transitions. [2024-11-16 18:52:26,513 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 473 transitions. Word has length 122 [2024-11-16 18:52:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:26,513 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 473 transitions. [2024-11-16 18:52:26,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 18:52:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 473 transitions. [2024-11-16 18:52:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:52:26,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:26,515 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] [2024-11-16 18:52:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:52:26,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -748354619, now seen corresponding path program 1 times [2024-11-16 18:52:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891449999] [2024-11-16 18:52:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:27,655 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:52:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891449999] [2024-11-16 18:52:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891449999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:52:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509112255] [2024-11-16 18:52:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:52:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:52:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:52:27,659 INFO L87 Difference]: Start difference. First operand 345 states and 473 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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:52:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:28,358 INFO L93 Difference]: Finished difference Result 565 states and 770 transitions. [2024-11-16 18:52:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:52:28,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 123 [2024-11-16 18:52:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:28,361 INFO L225 Difference]: With dead ends: 565 [2024-11-16 18:52:28,361 INFO L226 Difference]: Without dead ends: 422 [2024-11-16 18:52:28,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:52:28,362 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 213 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:28,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 981 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:52:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-16 18:52:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 347. [2024-11-16 18:52:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 307 states have (on average 1.3127035830618892) internal successors, (403), 307 states have internal predecessors, (403), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 475 transitions. [2024-11-16 18:52:28,400 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 475 transitions. Word has length 123 [2024-11-16 18:52:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:28,402 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 475 transitions. [2024-11-16 18:52:28,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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:52:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 475 transitions. [2024-11-16 18:52:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:52:28,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:28,404 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] [2024-11-16 18:52:28,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:52:28,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:28,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash -70828131, now seen corresponding path program 1 times [2024-11-16 18:52:28,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:28,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700893500] [2024-11-16 18:52:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:28,968 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:52:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700893500] [2024-11-16 18:52:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700893500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:28,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:28,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:52:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899350421] [2024-11-16 18:52:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:28,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:52:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:52:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:52:28,971 INFO L87 Difference]: Start difference. First operand 347 states and 475 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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:52:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:29,545 INFO L93 Difference]: Finished difference Result 732 states and 996 transitions. [2024-11-16 18:52:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:52:29,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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 123 [2024-11-16 18:52:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:29,548 INFO L225 Difference]: With dead ends: 732 [2024-11-16 18:52:29,548 INFO L226 Difference]: Without dead ends: 454 [2024-11-16 18:52:29,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:52:29,549 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 162 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:29,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1434 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-16 18:52:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 375. [2024-11-16 18:52:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 335 states have (on average 1.31044776119403) internal successors, (439), 335 states have internal predecessors, (439), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:52:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 511 transitions. [2024-11-16 18:52:29,582 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 511 transitions. Word has length 123 [2024-11-16 18:52:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:29,583 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 511 transitions. [2024-11-16 18:52:29,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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:52:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 511 transitions. [2024-11-16 18:52:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:52:29,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:29,584 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] [2024-11-16 18:52:29,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:52:29,584 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:29,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1173936350, now seen corresponding path program 1 times [2024-11-16 18:52:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321351042] [2024-11-16 18:52:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:30,602 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:52:30,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:30,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321351042] [2024-11-16 18:52:30,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321351042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:30,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:30,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:52:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229635852] [2024-11-16 18:52:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:30,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:52:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:52:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:52:30,604 INFO L87 Difference]: Start difference. First operand 375 states and 511 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 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) [2024-11-16 18:52:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:31,077 INFO L93 Difference]: Finished difference Result 769 states and 1038 transitions. [2024-11-16 18:52:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 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) Word has length 123 [2024-11-16 18:52:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:31,080 INFO L225 Difference]: With dead ends: 769 [2024-11-16 18:52:31,080 INFO L226 Difference]: Without dead ends: 463 [2024-11-16 18:52:31,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:52:31,081 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 427 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:31,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 543 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:52:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-16 18:52:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2024-11-16 18:52:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 411 states have (on average 1.3017031630170317) internal successors, (535), 413 states have internal predecessors, (535), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 18:52:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 615 transitions. [2024-11-16 18:52:31,121 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 615 transitions. Word has length 123 [2024-11-16 18:52:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 615 transitions. [2024-11-16 18:52:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 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) [2024-11-16 18:52:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 615 transitions. [2024-11-16 18:52:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:52:31,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:31,123 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:52:31,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:52:31,123 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1826571126, now seen corresponding path program 1 times [2024-11-16 18:52:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659901310] [2024-11-16 18:52:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,098 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:52:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659901310] [2024-11-16 18:52:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659901310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:35,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-16 18:52:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306191938] [2024-11-16 18:52:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:35,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 18:52:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 18:52:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:52:35,101 INFO L87 Difference]: Start difference. First operand 458 states and 615 transitions. Second operand has 21 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 18:52:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:42,144 INFO L93 Difference]: Finished difference Result 987 states and 1307 transitions. [2024-11-16 18:52:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:52:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 124 [2024-11-16 18:52:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:42,153 INFO L225 Difference]: With dead ends: 987 [2024-11-16 18:52:42,153 INFO L226 Difference]: Without dead ends: 782 [2024-11-16 18:52:42,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 18:52:42,155 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 467 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:42,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1559 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 18:52:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-16 18:52:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 476. [2024-11-16 18:52:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 429 states have (on average 1.2960372960372961) internal successors, (556), 431 states have internal predecessors, (556), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 18:52:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 636 transitions. [2024-11-16 18:52:42,214 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 636 transitions. Word has length 124 [2024-11-16 18:52:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:42,214 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 636 transitions. [2024-11-16 18:52:42,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 18:52:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 636 transitions. [2024-11-16 18:52:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:52:42,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:42,216 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:52:42,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 18:52:42,217 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2081307671, now seen corresponding path program 1 times [2024-11-16 18:52:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:42,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898073908] [2024-11-16 18:52:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:52:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:52:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:52:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:52:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:52:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:52:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:52:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:52:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:52:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,931 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:52:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:45,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898073908] [2024-11-16 18:52:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898073908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:45,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:45,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-16 18:52:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612966552] [2024-11-16 18:52:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:45,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 18:52:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 18:52:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:52:45,934 INFO L87 Difference]: Start difference. First operand 476 states and 636 transitions. Second operand has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 20 states have internal predecessors, (67), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 18:52:51,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []