./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.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-83.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 a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:02:28,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:02:28,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:02:28,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:02:28,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:02:28,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:02:28,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:02:28,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:02:28,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:02:28,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:02:28,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:02:28,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:02:28,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:02:28,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:02:28,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:02:28,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:02:28,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:02:28,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:02:28,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:02:28,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:02:28,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:02:28,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:02:28,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:02:28,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:02:28,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:02:28,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:02:28,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:02:28,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:02:28,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:02:28,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:02:28,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:02:28,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:02:28,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:28,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:02:28,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:02:28,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:02:28,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:02:28,655 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2024-11-10 10:02:28,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:02:28,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:02:28,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:02:28,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:02:28,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:02:28,962 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-83.i [2024-11-10 10:02:30,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:02:30,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:02:30,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-11-10 10:02:30,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc595765a/547a4464e0b5427b85a54cfdfa3eeb0d/FLAG48a11c42b [2024-11-10 10:02:30,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc595765a/547a4464e0b5427b85a54cfdfa3eeb0d [2024-11-10 10:02:30,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:02:30,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:02:30,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:30,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:02:30,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:02:30,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:30,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4293b223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30, skipping insertion in model container [2024-11-10 10:02:30,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:30,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:02:30,778 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-83.i[917,930] [2024-11-10 10:02:30,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:30,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:02:30,852 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-83.i[917,930] [2024-11-10 10:02:30,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:30,986 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:02:30,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30 WrapperNode [2024-11-10 10:02:30,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:30,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:30,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:02:30,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:02:30,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,062 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-10 10:02:31,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:31,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:02:31,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:02:31,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:02:31,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,090 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:02:31,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:02:31,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:02:31,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:02:31,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:02:31,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (1/1) ... [2024-11-10 10:02:31,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:31,162 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 10:02:31,168 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 10:02:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:02:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:02:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:02:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:02:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:02:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:02:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:02:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:02:31,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:02:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:02:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:02:31,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:02:31,361 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:02:31,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:02:31,802 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 10:02:31,847 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-10 10:02:31,848 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:02:31,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:02:31,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:02:31,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:31 BoogieIcfgContainer [2024-11-10 10:02:31,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:02:31,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:02:31,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:02:31,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:02:31,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:02:30" (1/3) ... [2024-11-10 10:02:31,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15aadb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:31, skipping insertion in model container [2024-11-10 10:02:31,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:30" (2/3) ... [2024-11-10 10:02:31,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15aadb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:31, skipping insertion in model container [2024-11-10 10:02:31,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:31" (3/3) ... [2024-11-10 10:02:31,884 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2024-11-10 10:02:31,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:02:31,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:02:31,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:02:31,966 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;@9066941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:02:31,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:02:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 102 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 10:02:31,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:31,985 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:31,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -18529254, now seen corresponding path program 1 times [2024-11-10 10:02:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139940088] [2024-11-10 10:02:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:32,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139940088] [2024-11-10 10:02:32,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139940088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:32,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:32,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:02:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867760200] [2024-11-10 10:02:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:32,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:02:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:02:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:02:32,425 INFO L87 Difference]: Start difference. First operand has 115 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 102 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:02:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:32,484 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2024-11-10 10:02:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:02:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-10 10:02:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:32,501 INFO L225 Difference]: With dead ends: 222 [2024-11-10 10:02:32,505 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 10:02:32,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 10:02:32,516 INFO L432 NwaCegarLoop]: 153 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, 153 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 10:02:32,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 10:02:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 10:02:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-10 10:02:32,615 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 108 [2024-11-10 10:02:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-10 10:02:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:02:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-10 10:02:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 10:02:32,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:32,627 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:32,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:02:32,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:32,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2002722095, now seen corresponding path program 1 times [2024-11-10 10:02:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711722118] [2024-11-10 10:02:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711722118] [2024-11-10 10:02:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711722118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:02:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373825802] [2024-11-10 10:02:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:02:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:02:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:32,971 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:33,036 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-11-10 10:02:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:02:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-10 10:02:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:33,039 INFO L225 Difference]: With dead ends: 220 [2024-11-10 10:02:33,039 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 10:02:33,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:33,044 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:33,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 10:02:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-10 10:02:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-10 10:02:33,062 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 108 [2024-11-10 10:02:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:33,064 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-10 10:02:33,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-10 10:02:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 10:02:33,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:33,070 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:33,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:02:33,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2095731696, now seen corresponding path program 1 times [2024-11-10 10:02:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118105945] [2024-11-10 10:02:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118105945] [2024-11-10 10:02:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118105945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:33,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:02:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562257146] [2024-11-10 10:02:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:02:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:02:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:33,332 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:33,378 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2024-11-10 10:02:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:02:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-10 10:02:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:33,386 INFO L225 Difference]: With dead ends: 224 [2024-11-10 10:02:33,386 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 10:02:33,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:33,389 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:33,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 10:02:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 10:02:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-10 10:02:33,430 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 108 [2024-11-10 10:02:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-10 10:02:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-10 10:02:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 10:02:33,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:33,435 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:02:33,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -456425265, now seen corresponding path program 1 times [2024-11-10 10:02:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472945218] [2024-11-10 10:02:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472945218] [2024-11-10 10:02:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472945218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:02:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715034464] [2024-11-10 10:02:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:34,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:02:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:02:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:02:34,384 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:34,810 INFO L93 Difference]: Finished difference Result 225 states and 315 transitions. [2024-11-10 10:02:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:02:34,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-10 10:02:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:34,813 INFO L225 Difference]: With dead ends: 225 [2024-11-10 10:02:34,814 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 10:02:34,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:02:34,815 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 144 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:34,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 372 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:02:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 10:02:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-10 10:02:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2024-11-10 10:02:34,825 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 108 [2024-11-10 10:02:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2024-11-10 10:02:34,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2024-11-10 10:02:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 10:02:34,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:34,827 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:34,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:02:34,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:34,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -950186219, now seen corresponding path program 1 times [2024-11-10 10:02:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937219377] [2024-11-10 10:02:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937219377] [2024-11-10 10:02:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937219377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:02:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462094919] [2024-11-10 10:02:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:02:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:02:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:02:35,050 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:35,213 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2024-11-10 10:02:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:02:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-10 10:02:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:35,215 INFO L225 Difference]: With dead ends: 227 [2024-11-10 10:02:35,215 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 10:02:35,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:02:35,216 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:35,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 485 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:02:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 10:02:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-10 10:02:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2024-11-10 10:02:35,223 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 109 [2024-11-10 10:02:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:35,223 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2024-11-10 10:02:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:02:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2024-11-10 10:02:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:02:35,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:35,224 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:02:35,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:35,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1790109324, now seen corresponding path program 1 times [2024-11-10 10:02:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314486274] [2024-11-10 10:02:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:02:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:02:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:02:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314486274] [2024-11-10 10:02:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314486274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:02:37,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824055817] [2024-11-10 10:02:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:37,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:02:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:02:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:02:37,318 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-10 10:02:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:38,546 INFO L93 Difference]: Finished difference Result 298 states and 411 transitions. [2024-11-10 10:02:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:02:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 110 [2024-11-10 10:02:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:38,548 INFO L225 Difference]: With dead ends: 298 [2024-11-10 10:02:38,548 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 10:02:38,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-10 10:02:38,549 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 286 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:38,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 662 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 10:02:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 10:02:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2024-11-10 10:02:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 124 states have internal predecessors, (168), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 10:02:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2024-11-10 10:02:38,562 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 110 [2024-11-10 10:02:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:38,563 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2024-11-10 10:02:38,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-10 10:02:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2024-11-10 10:02:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:02:38,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:38,564 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:38,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:02:38,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -436799627, now seen corresponding path program 1 times [2024-11-10 10:02:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:38,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324893502] [2024-11-10 10:02:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:02:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860128984] [2024-11-10 10:02:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:02:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:38,712 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 10:02:38,713 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 10:02:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:39,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-10 10:02:39,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:02:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:02:41,077 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 10:02:41,998 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 10:02:42,380 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 10:02:42,752 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 10:02:43,341 INFO L349 Elim1Store]: treesize reduction 254, result has 27.2 percent of original size [2024-11-10 10:02:43,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 149 [2024-11-10 10:02:43,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2024-11-10 10:02:43,519 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-10 10:02:43,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-10 10:02:43,566 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-10 10:02:43,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 122 [2024-11-10 10:02:43,798 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:43,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-10 10:02:43,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:43,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-10 10:02:43,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:43,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:44,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:44,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2024-11-10 10:02:44,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:44,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:44,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-10 10:02:44,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:44,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:44,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-10 10:02:44,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:44,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 10:02:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-10 10:02:44,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 10:02:44,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 10:02:44,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 10:02:44,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 10:02:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:44,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:44,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2024-11-10 10:02:44,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:44,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-10 10:02:46,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,144 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 43 treesize of output 44 [2024-11-10 10:02:46,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,653 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 53 treesize of output 46 [2024-11-10 10:02:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:46,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-10 10:02:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-10 10:02:46,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:02:52,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324893502] [2024-11-10 10:02:52,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:02:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860128984] [2024-11-10 10:02:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860128984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:02:52,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:02:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 10:02:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897119766] [2024-11-10 10:02:52,213 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 10:02:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:02:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:02:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=362, Unknown=15, NotChecked=0, Total=462 [2024-11-10 10:02:52,215 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:02:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:54,397 INFO L93 Difference]: Finished difference Result 426 states and 587 transitions. [2024-11-10 10:02:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:02:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-10 10:02:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:54,399 INFO L225 Difference]: With dead ends: 426 [2024-11-10 10:02:54,399 INFO L226 Difference]: Without dead ends: 292 [2024-11-10 10:02:54,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=185, Invalid=612, Unknown=15, NotChecked=0, Total=812 [2024-11-10 10:02:54,403 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 698 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:54,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 770 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 10:02:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-10 10:02:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 206. [2024-11-10 10:02:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 191 states have internal predecessors, (257), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 10:02:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2024-11-10 10:02:54,433 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 110 [2024-11-10 10:02:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:54,433 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2024-11-10 10:02:54,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:02:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2024-11-10 10:02:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:02:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:54,435 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:54,464 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 10:02:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:02:54,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1433871980, now seen corresponding path program 1 times [2024-11-10 10:02:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699876481] [2024-11-10 10:02:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:02:54,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716799324] [2024-11-10 10:02:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:02:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:54,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:02:54,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:02:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:55,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 10:02:55,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:02:55,138 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 71 treesize of output 70 [2024-11-10 10:02:56,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 96 [2024-11-10 10:02:57,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:02:57,709 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-10 10:02:57,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-11-10 10:02:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:02:57,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:02:57,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699876481] [2024-11-10 10:02:57,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:02:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716799324] [2024-11-10 10:02:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716799324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:57,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:02:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714109189] [2024-11-10 10:02:57,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:57,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:02:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:02:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:02:57,940 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:03:04,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:08,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:12,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:16,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:20,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:24,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:28,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:30,107 INFO L93 Difference]: Finished difference Result 634 states and 874 transitions. [2024-11-10 10:03:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:03:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-10 10:03:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:30,110 INFO L225 Difference]: With dead ends: 634 [2024-11-10 10:03:30,113 INFO L226 Difference]: Without dead ends: 431 [2024-11-10 10:03:30,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:03:30,115 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 208 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 12 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:30,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 540 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 420 Invalid, 7 Unknown, 0 Unchecked, 31.7s Time] [2024-11-10 10:03:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-10 10:03:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 256. [2024-11-10 10:03:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 227 states have (on average 1.3348017621145374) internal successors, (303), 228 states have internal predecessors, (303), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 10:03:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 351 transitions. [2024-11-10 10:03:30,156 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 351 transitions. Word has length 110 [2024-11-10 10:03:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:30,157 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 351 transitions. [2024-11-10 10:03:30,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:03:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2024-11-10 10:03:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:03:30,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:30,159 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:30,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:03:30,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 10:03:30,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 137154131, now seen corresponding path program 1 times [2024-11-10 10:03:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521692607] [2024-11-10 10:03:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:03:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:03:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:03:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:03:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:03:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:03:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:03:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:03:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:03:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:03:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:03:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:03:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521692607] [2024-11-10 10:03:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521692607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:03:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050557752] [2024-11-10 10:03:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:03:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:03:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:03:31,342 INFO L87 Difference]: Start difference. First operand 256 states and 351 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:03:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:31,800 INFO L93 Difference]: Finished difference Result 463 states and 634 transitions. [2024-11-10 10:03:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:31,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-10 10:03:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:31,803 INFO L225 Difference]: With dead ends: 463 [2024-11-10 10:03:31,803 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 10:03:31,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:03:31,804 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 186 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:31,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 385 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:03:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 10:03:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-10 10:03:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.3217391304347825) internal successors, (304), 231 states have internal predecessors, (304), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 10:03:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 352 transitions. [2024-11-10 10:03:31,837 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 352 transitions. Word has length 110 [2024-11-10 10:03:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:31,837 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 352 transitions. [2024-11-10 10:03:31,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 10:03:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2024-11-10 10:03:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:03:31,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:31,838 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:31,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:03:31,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1097007627, now seen corresponding path program 1 times [2024-11-10 10:03:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846938873] [2024-11-10 10:03:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:03:31,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886896027] [2024-11-10 10:03:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:31,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:03:31,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:03:31,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:03:31,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:03:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:32,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 10:03:32,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:32,230 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 71 treesize of output 70 [2024-11-10 10:03:32,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2024-11-10 10:03:33,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:33,762 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 25 treesize of output 13 [2024-11-10 10:03:33,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 10:03:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:03:33,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846938873] [2024-11-10 10:03:33,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:03:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886896027] [2024-11-10 10:03:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886896027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:03:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558640806] [2024-11-10 10:03:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:03:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:03:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:03:33,830 INFO L87 Difference]: Start difference. First operand 260 states and 352 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:03:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:37,158 INFO L93 Difference]: Finished difference Result 582 states and 787 transitions. [2024-11-10 10:03:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-10 10:03:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:37,160 INFO L225 Difference]: With dead ends: 582 [2024-11-10 10:03:37,161 INFO L226 Difference]: Without dead ends: 375 [2024-11-10 10:03:37,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:03:37,161 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 161 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:37,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 584 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 10:03:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-10 10:03:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 267. [2024-11-10 10:03:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 237 states have internal predecessors, (310), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 10:03:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2024-11-10 10:03:37,191 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 110 [2024-11-10 10:03:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:37,191 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2024-11-10 10:03:37,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:03:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2024-11-10 10:03:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 10:03:37,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:37,192 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:37,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:03:37,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:03:37,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -425483500, now seen corresponding path program 1 times [2024-11-10 10:03:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:03:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093826784] [2024-11-10 10:03:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:03:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:03:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337190234] [2024-11-10 10:03:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:37,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:03:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:03:37,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:03:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:03:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:37,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 10:03:37,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:37,992 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 65 treesize of output 64 [2024-11-10 10:03:38,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2024-11-10 10:03:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:39,732 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-10 10:03:39,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-11-10 10:03:40,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:03:40,049 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-10 10:03:40,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-10 10:03:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 10:03:40,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:03:40,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093826784] [2024-11-10 10:03:40,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:03:40,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337190234] [2024-11-10 10:03:40,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337190234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:40,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:40,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:03:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775054395] [2024-11-10 10:03:40,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:40,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:03:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:03:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:03:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:03:40,180 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 10:03:49,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:53,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:03:57,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:04:01,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:04:05,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]