./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.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 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:57:21,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:57:21,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:57:21,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:57:21,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:57:21,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:57:21,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:57:21,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:57:21,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:57:21,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:57:21,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:57:21,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:57:21,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:57:21,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:57:21,999 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:57:22,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:57:22,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:57:22,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:57:22,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:57:22,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:57:22,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:57:22,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:57:22,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:57:22,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:57:22,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:57:22,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:57:22,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:57:22,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:57:22,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:57:22,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:57:22,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:57:22,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:57:22,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:22,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:57:22,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:57:22,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:57:22,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:57:22,008 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 -> 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 [2024-11-10 09:57:22,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:57:22,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:57:22,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:57:22,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:57:22,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:57:22,262 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-39.i [2024-11-10 09:57:23,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:57:24,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:57:24,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-10 09:57:24,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2356a0739/0841eed59d924901a1794371edd58f6f/FLAG0aa1d28f8 [2024-11-10 09:57:24,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2356a0739/0841eed59d924901a1794371edd58f6f [2024-11-10 09:57:24,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:57:24,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:57:24,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:24,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:57:24,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:57:24,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f08407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24, skipping insertion in model container [2024-11-10 09:57:24,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:57:24,540 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-39.i[917,930] [2024-11-10 09:57:24,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:24,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:57:24,639 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-39.i[917,930] [2024-11-10 09:57:24,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:24,685 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:57:24,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24 WrapperNode [2024-11-10 09:57:24,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:24,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:24,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:57:24,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:57:24,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,734 INFO L138 Inliner]: procedures = 30, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 611 [2024-11-10 09:57:24,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:24,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:57:24,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:57:24,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:57:24,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,765 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:57:24,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:57:24,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:57:24,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:57:24,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:57:24,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (1/1) ... [2024-11-10 09:57:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:24,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:57:24,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:57:24,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:57:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:57:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:57:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:57:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:57:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:57:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:57:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:57:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:57:24,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:57:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:57:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:57:24,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:57:25,021 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:57:25,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:57:25,430 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem113#1;havoc property_#t~mem106#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite131#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem123#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~bitwise135#1;havoc property_#t~mem137#1;havoc property_#t~ite176#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite173#1;havoc property_#t~mem170#1;havoc property_#t~mem148#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~ite155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite169#1;havoc property_#t~mem161#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem158#1;havoc property_#t~mem159#1;havoc property_#t~ite168#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem172#1;havoc property_#t~mem171#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short177#1; [2024-11-10 09:57:25,482 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-10 09:57:25,483 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:57:25,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:57:25,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:57:25,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:25 BoogieIcfgContainer [2024-11-10 09:57:25,511 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:57:25,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:57:25,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:57:25,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:57:25,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:57:24" (1/3) ... [2024-11-10 09:57:25,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421f1eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:25, skipping insertion in model container [2024-11-10 09:57:25,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:24" (2/3) ... [2024-11-10 09:57:25,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421f1eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:25, skipping insertion in model container [2024-11-10 09:57:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:25" (3/3) ... [2024-11-10 09:57:25,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-10 09:57:25,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:57:25,541 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:57:25,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:57:25,601 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;@5f8ee53c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:57:25,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:57:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:57:25,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:25,616 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:57:25,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash -198680285, now seen corresponding path program 1 times [2024-11-10 09:57:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532334052] [2024-11-10 09:57:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:57:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:57:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:57:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:57:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532334052] [2024-11-10 09:57:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532334052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:57:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039907748] [2024-11-10 09:57:26,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:26,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:57:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:57:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:57:26,175 INFO L87 Difference]: Start difference. First operand has 123 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:26,211 INFO L93 Difference]: Finished difference Result 238 states and 369 transitions. [2024-11-10 09:57:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:57:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-11-10 09:57:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:26,222 INFO L225 Difference]: With dead ends: 238 [2024-11-10 09:57:26,222 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 09:57:26,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:57:26,229 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:26,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 09:57:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 09:57:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-10 09:57:26,273 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 130 [2024-11-10 09:57:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:26,274 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-10 09:57:26,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-10 09:57:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:57:26,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:26,277 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:57:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:57:26,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:26,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash -502687679, now seen corresponding path program 1 times [2024-11-10 09:57:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939116764] [2024-11-10 09:57:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:57:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:57:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:57:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:57:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939116764] [2024-11-10 09:57:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939116764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 09:57:33,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725433559] [2024-11-10 09:57:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:33,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:57:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:57:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:57:33,409 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:36,690 INFO L93 Difference]: Finished difference Result 299 states and 436 transitions. [2024-11-10 09:57:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 09:57:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 130 [2024-11-10 09:57:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:36,693 INFO L225 Difference]: With dead ends: 299 [2024-11-10 09:57:36,693 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 09:57:36,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2024-11-10 09:57:36,695 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 529 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:36,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 767 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 09:57:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 09:57:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2024-11-10 09:57:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.4) internal successors, (154), 110 states have internal predecessors, (154), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-10 09:57:36,710 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 130 [2024-11-10 09:57:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:36,711 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-10 09:57:36,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-10 09:57:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:57:36,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:36,713 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:57:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:57:36,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash -699201184, now seen corresponding path program 1 times [2024-11-10 09:57:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737811688] [2024-11-10 09:57:36,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:36,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:57:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:57:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:57:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:57:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737811688] [2024-11-10 09:57:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737811688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 09:57:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470873401] [2024-11-10 09:57:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:57:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:38,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:57:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:57:38,915 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:40,315 INFO L93 Difference]: Finished difference Result 380 states and 552 transitions. [2024-11-10 09:57:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:57:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 130 [2024-11-10 09:57:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:40,318 INFO L225 Difference]: With dead ends: 380 [2024-11-10 09:57:40,318 INFO L226 Difference]: Without dead ends: 255 [2024-11-10 09:57:40,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:57:40,320 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 565 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:40,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 770 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:57:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-10 09:57:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2024-11-10 09:57:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 174 states have internal predecessors, (244), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:57:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-11-10 09:57:40,339 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 130 [2024-11-10 09:57:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-11-10 09:57:40,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-11-10 09:57:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:57:40,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:40,342 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:57:40,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:57:40,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:40,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1499760032, now seen corresponding path program 1 times [2024-11-10 09:57:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656515597] [2024-11-10 09:57:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:57:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:57:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:57:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:57:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:43,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656515597] [2024-11-10 09:57:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656515597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 09:57:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269295269] [2024-11-10 09:57:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:43,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:57:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:57:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:57:43,858 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:46,354 INFO L93 Difference]: Finished difference Result 508 states and 728 transitions. [2024-11-10 09:57:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:57:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 130 [2024-11-10 09:57:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:46,358 INFO L225 Difference]: With dead ends: 508 [2024-11-10 09:57:46,358 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 09:57:46,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:57:46,364 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1125 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:46,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 946 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 09:57:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 09:57:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 160. [2024-11-10 09:57:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 230 transitions. [2024-11-10 09:57:46,416 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 230 transitions. Word has length 130 [2024-11-10 09:57:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 230 transitions. [2024-11-10 09:57:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:57:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 230 transitions. [2024-11-10 09:57:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:57:46,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:46,420 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:57:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:57:46,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1696273537, now seen corresponding path program 1 times [2024-11-10 09:57:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659078932] [2024-11-10 09:57:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:57:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:57:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:57:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:57:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:57:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:57:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659078932] [2024-11-10 09:57:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659078932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:57:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389227961] [2024-11-10 09:57:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:49,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:57:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:57:49,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:57:49,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:57:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:50,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-10 09:57:50,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:57:50,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:57:51,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-10 09:57:52,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-10 09:57:53,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-10 09:57:54,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-10 09:57:54,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-10 09:57:55,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-10 09:57:55,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-10 09:57:56,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-10 09:57:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 112 [2024-11-10 09:57:57,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:57,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 123 [2024-11-10 09:57:58,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,605 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-10 09:57:58,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 111 [2024-11-10 09:57:58,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:57:58,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 73 [2024-11-10 09:57:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 154 proven. 223 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-10 09:57:59,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:58:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389227961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:58:13,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:58:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31] total 46 [2024-11-10 09:58:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561618015] [2024-11-10 09:58:13,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:58:13,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 09:58:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 09:58:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2825, Unknown=1, NotChecked=0, Total=3192 [2024-11-10 09:58:13,565 INFO L87 Difference]: Start difference. First operand 160 states and 230 transitions. Second operand has 46 states, 41 states have (on average 2.902439024390244) internal successors, (119), 43 states have internal predecessors, (119), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 7 states have call predecessors, (32), 10 states have call successors, (32) [2024-11-10 09:58:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:21,408 INFO L93 Difference]: Finished difference Result 472 states and 666 transitions. [2024-11-10 09:58:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 09:58:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 2.902439024390244) internal successors, (119), 43 states have internal predecessors, (119), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 7 states have call predecessors, (32), 10 states have call successors, (32) Word has length 130 [2024-11-10 09:58:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:21,411 INFO L225 Difference]: With dead ends: 472 [2024-11-10 09:58:21,411 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 09:58:21,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=955, Invalid=5686, Unknown=1, NotChecked=0, Total=6642 [2024-11-10 09:58:21,413 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 681 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:21,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 2371 Invalid, 3895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-10 09:58:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 09:58:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2024-11-10 09:58:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.3941176470588235) internal successors, (237), 170 states have internal predecessors, (237), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2024-11-10 09:58:21,441 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 130 [2024-11-10 09:58:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:21,441 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2024-11-10 09:58:21,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 2.902439024390244) internal successors, (119), 43 states have internal predecessors, (119), 10 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 7 states have call predecessors, (32), 10 states have call successors, (32) [2024-11-10 09:58:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2024-11-10 09:58:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:58:21,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:21,443 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:21,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:58:21,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:58:21,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1652346453, now seen corresponding path program 1 times [2024-11-10 09:58:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:21,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754973128] [2024-11-10 09:58:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754973128] [2024-11-10 09:58:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754973128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:58:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052971358] [2024-11-10 09:58:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:25,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:58:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:58:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:58:25,859 INFO L87 Difference]: Start difference. First operand 193 states and 269 transitions. Second operand has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-10 09:58:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:28,386 INFO L93 Difference]: Finished difference Result 423 states and 590 transitions. [2024-11-10 09:58:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:58:28,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) Word has length 131 [2024-11-10 09:58:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:28,389 INFO L225 Difference]: With dead ends: 423 [2024-11-10 09:58:28,389 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 09:58:28,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:58:28,390 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 416 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:28,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 964 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 09:58:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 09:58:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 187. [2024-11-10 09:58:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.396341463414634) internal successors, (229), 164 states have internal predecessors, (229), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 261 transitions. [2024-11-10 09:58:28,426 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 261 transitions. Word has length 131 [2024-11-10 09:58:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 261 transitions. [2024-11-10 09:58:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-10 09:58:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 261 transitions. [2024-11-10 09:58:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:58:28,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:28,427 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:58:28,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:28,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1798148972, now seen corresponding path program 1 times [2024-11-10 09:58:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:28,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512073190] [2024-11-10 09:58:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512073190] [2024-11-10 09:58:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512073190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:58:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597198373] [2024-11-10 09:58:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:58:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:58:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:58:30,219 INFO L87 Difference]: Start difference. First operand 187 states and 261 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:58:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:31,830 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2024-11-10 09:58:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:58:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2024-11-10 09:58:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:31,832 INFO L225 Difference]: With dead ends: 433 [2024-11-10 09:58:31,832 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 09:58:31,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:58:31,833 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 327 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:31,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 615 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 09:58:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 09:58:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2024-11-10 09:58:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 160 states have (on average 1.3875) internal successors, (222), 160 states have internal predecessors, (222), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 254 transitions. [2024-11-10 09:58:31,862 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 254 transitions. Word has length 131 [2024-11-10 09:58:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:31,863 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 254 transitions. [2024-11-10 09:58:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:58:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 254 transitions. [2024-11-10 09:58:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:58:31,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:31,864 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:31,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:58:31,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1861837834, now seen corresponding path program 1 times [2024-11-10 09:58:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94764339] [2024-11-10 09:58:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94764339] [2024-11-10 09:58:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94764339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:58:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823330092] [2024-11-10 09:58:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:58:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:58:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:58:32,493 INFO L87 Difference]: Start difference. First operand 183 states and 254 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:58:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:33,103 INFO L93 Difference]: Finished difference Result 423 states and 590 transitions. [2024-11-10 09:58:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:58:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-11-10 09:58:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:33,105 INFO L225 Difference]: With dead ends: 423 [2024-11-10 09:58:33,105 INFO L226 Difference]: Without dead ends: 243 [2024-11-10 09:58:33,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:58:33,106 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 199 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:33,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 868 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:58:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-10 09:58:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 208. [2024-11-10 09:58:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 185 states have internal predecessors, (258), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 290 transitions. [2024-11-10 09:58:33,154 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 290 transitions. Word has length 132 [2024-11-10 09:58:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 290 transitions. [2024-11-10 09:58:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:58:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 290 transitions. [2024-11-10 09:58:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:58:33,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:33,155 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:58:33,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2146845781, now seen corresponding path program 1 times [2024-11-10 09:58:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367688050] [2024-11-10 09:58:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:37,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367688050] [2024-11-10 09:58:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367688050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:37,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:58:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845621928] [2024-11-10 09:58:37,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:37,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:58:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:37,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:58:37,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:58:37,390 INFO L87 Difference]: Start difference. First operand 208 states and 290 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:58:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:40,145 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2024-11-10 09:58:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:58:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 133 [2024-11-10 09:58:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:40,147 INFO L225 Difference]: With dead ends: 455 [2024-11-10 09:58:40,147 INFO L226 Difference]: Without dead ends: 250 [2024-11-10 09:58:40,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:58:40,148 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 314 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:40,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 936 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 09:58:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-10 09:58:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 206. [2024-11-10 09:58:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 183 states have (on average 1.3934426229508197) internal successors, (255), 183 states have internal predecessors, (255), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2024-11-10 09:58:40,179 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 133 [2024-11-10 09:58:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:40,180 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2024-11-10 09:58:40,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:58:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2024-11-10 09:58:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:58:40,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:40,181 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:40,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:58:40,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:40,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1000019540, now seen corresponding path program 1 times [2024-11-10 09:58:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118716120] [2024-11-10 09:58:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118716120] [2024-11-10 09:58:41,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118716120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:41,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:41,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:58:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440390340] [2024-11-10 09:58:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:41,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:58:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:58:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:58:41,453 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:58:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:58:42,248 INFO L93 Difference]: Finished difference Result 444 states and 619 transitions. [2024-11-10 09:58:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:58:42,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-10 09:58:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:58:42,249 INFO L225 Difference]: With dead ends: 444 [2024-11-10 09:58:42,250 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 09:58:42,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:58:42,251 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 287 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:58:42,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 540 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:58:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 09:58:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 206. [2024-11-10 09:58:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 183 states have (on average 1.3879781420765027) internal successors, (254), 183 states have internal predecessors, (254), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:58:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 286 transitions. [2024-11-10 09:58:42,283 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 286 transitions. Word has length 135 [2024-11-10 09:58:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:58:42,284 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 286 transitions. [2024-11-10 09:58:42,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:58:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 286 transitions. [2024-11-10 09:58:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:58:42,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:58:42,285 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:58:42,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:58:42,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:58:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:58:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -279348761, now seen corresponding path program 1 times [2024-11-10 09:58:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:58:42,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622301617] [2024-11-10 09:58:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:58:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:58:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:58:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:58:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:58:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:58:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:58:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:58:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:58:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:58:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:58:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:58:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:58:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:58:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:58:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:58:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:58:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:58:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:58:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:58:44,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:58:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622301617] [2024-11-10 09:58:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622301617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:58:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:58:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 09:58:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429516313] [2024-11-10 09:58:44,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:58:44,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 09:58:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:58:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 09:58:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:58:44,683 INFO L87 Difference]: Start difference. First operand 206 states and 286 transitions. Second operand has 18 states, 16 states have (on average 3.6875) internal successors, (59), 18 states have internal predecessors, (59), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16)