./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.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 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:26:27,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:26:28,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:26:28,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:26:28,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:26:28,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:26:28,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:26:28,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:26:28,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:26:28,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:26:28,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:26:28,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:26:28,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:26:28,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:26:28,064 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:26:28,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:26:28,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:26:28,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:26:28,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:26:28,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:26:28,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:26:28,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:26:28,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:26:28,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:26:28,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:26:28,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:26:28,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:26:28,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:26:28,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:26:28,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:26:28,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:26:28,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:26:28,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:28,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:26:28,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:26:28,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:26:28,070 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 -> 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf [2024-10-14 13:26:28,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:26:28,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:26:28,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:26:28,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:26:28,270 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:26:28,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2024-10-14 13:26:29,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:26:29,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:26:29,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2024-10-14 13:26:29,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82afab66b/4077878c5e1746e2807b835f0468b981/FLAG570b23a81 [2024-10-14 13:26:29,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82afab66b/4077878c5e1746e2807b835f0468b981 [2024-10-14 13:26:29,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:26:29,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:26:29,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:29,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:26:29,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:26:29,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da6bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29, skipping insertion in model container [2024-10-14 13:26:29,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:26:29,774 WARN L248 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-a_file-58.i[916,929] [2024-10-14 13:26:29,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:29,837 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:26:29,846 WARN L248 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-a_file-58.i[916,929] [2024-10-14 13:26:29,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:29,910 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:26:29,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29 WrapperNode [2024-10-14 13:26:29,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:29,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:29,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:26:29,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:26:29,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,968 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2024-10-14 13:26:29,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:29,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:26:29,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:26:29,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:26:29,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,996 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2024-10-14 13:26:29,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:29,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:26:30,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:26:30,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:26:30,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:26:30,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (1/1) ... [2024-10-14 13:26:30,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:30,108 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-10-14 13:26:30,112 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-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:26:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:26:30,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:26:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:26:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:26:30,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:26:30,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:26:30,242 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:26:30,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:26:30,561 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-14 13:26:30,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:26:30,589 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:26:30,589 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:26:30,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:30 BoogieIcfgContainer [2024-10-14 13:26:30,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:26:30,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:26:30,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:26:30,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:26:30,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:26:29" (1/3) ... [2024-10-14 13:26:30,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f6306e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:30, skipping insertion in model container [2024-10-14 13:26:30,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:29" (2/3) ... [2024-10-14 13:26:30,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f6306e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:30, skipping insertion in model container [2024-10-14 13:26:30,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:30" (3/3) ... [2024-10-14 13:26:30,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-58.i [2024-10-14 13:26:30,609 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:26:30,609 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:26:30,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:26:30,656 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;@45a9a45b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:26:30,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:26:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:26:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:30,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:30,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:30,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -370712058, now seen corresponding path program 1 times [2024-10-14 13:26:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039533665] [2024-10-14 13:26:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039533665] [2024-10-14 13:26:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039533665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:30,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:26:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722706083] [2024-10-14 13:26:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:30,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:26:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:26:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:26:30,977 INFO L87 Difference]: Start difference. First operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:31,014 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2024-10-14 13:26:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:26:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-14 13:26:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:31,023 INFO L225 Difference]: With dead ends: 163 [2024-10-14 13:26:31,023 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 13:26:31,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-10-14 13:26:31,031 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:31,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 13:26:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 13:26:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:26:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-10-14 13:26:31,071 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 111 [2024-10-14 13:26:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:31,073 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-10-14 13:26:31,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-10-14 13:26:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:31,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:31,078 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:26:31,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:31,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash -433786332, now seen corresponding path program 1 times [2024-10-14 13:26:31,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:31,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840418830] [2024-10-14 13:26:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:31,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840418830] [2024-10-14 13:26:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840418830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774821858] [2024-10-14 13:26:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:31,378 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:31,416 INFO L93 Difference]: Finished difference Result 160 states and 229 transitions. [2024-10-14 13:26:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-14 13:26:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:31,419 INFO L225 Difference]: With dead ends: 160 [2024-10-14 13:26:31,419 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 13:26:31,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-10-14 13:26:31,421 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 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-10-14 13:26:31,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 13:26:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-14 13:26:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:26:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-14 13:26:31,436 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 111 [2024-10-14 13:26:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-14 13:26:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-14 13:26:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:31,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:31,442 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:31,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:26:31,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:31,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash -433726750, now seen corresponding path program 1 times [2024-10-14 13:26:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:31,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466681582] [2024-10-14 13:26:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:31,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466681582] [2024-10-14 13:26:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466681582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:26:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954893946] [2024-10-14 13:26:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:32,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:32,317 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:32,586 INFO L93 Difference]: Finished difference Result 230 states and 325 transitions. [2024-10-14 13:26:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-14 13:26:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:32,589 INFO L225 Difference]: With dead ends: 230 [2024-10-14 13:26:32,590 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 13:26:32,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:26:32,592 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 85 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:32,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 577 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:26:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 13:26:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-10-14 13:26:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 119 states have internal predecessors, (156), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 13:26:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 208 transitions. [2024-10-14 13:26:32,610 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 208 transitions. Word has length 111 [2024-10-14 13:26:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:32,610 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 208 transitions. [2024-10-14 13:26:32,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 208 transitions. [2024-10-14 13:26:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:32,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:32,612 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:32,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:26:32,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:32,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 267337828, now seen corresponding path program 1 times [2024-10-14 13:26:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546328324] [2024-10-14 13:26:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546328324] [2024-10-14 13:26:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546328324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:26:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270818355] [2024-10-14 13:26:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:26:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:26:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:26:33,735 INFO L87 Difference]: Start difference. First operand 147 states and 208 transitions. Second operand has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:26:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:34,095 INFO L93 Difference]: Finished difference Result 322 states and 450 transitions. [2024-10-14 13:26:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:26:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 111 [2024-10-14 13:26:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:34,098 INFO L225 Difference]: With dead ends: 322 [2024-10-14 13:26:34,100 INFO L226 Difference]: Without dead ends: 176 [2024-10-14 13:26:34,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:26:34,102 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 82 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:34,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 435 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-14 13:26:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2024-10-14 13:26:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.2890625) internal successors, (165), 130 states have internal predecessors, (165), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 13:26:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2024-10-14 13:26:34,129 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 111 [2024-10-14 13:26:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2024-10-14 13:26:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:26:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2024-10-14 13:26:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:34,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:34,131 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:26:34,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:34,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -133092051, now seen corresponding path program 1 times [2024-10-14 13:26:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263395688] [2024-10-14 13:26:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:34,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263395688] [2024-10-14 13:26:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263395688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017367447] [2024-10-14 13:26:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:34,363 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:34,528 INFO L93 Difference]: Finished difference Result 386 states and 538 transitions. [2024-10-14 13:26:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-14 13:26:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:34,531 INFO L225 Difference]: With dead ends: 386 [2024-10-14 13:26:34,531 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 13:26:34,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:34,532 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:34,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 483 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 13:26:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-14 13:26:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 183 states have (on average 1.284153005464481) internal successors, (235), 185 states have internal predecessors, (235), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 13:26:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 327 transitions. [2024-10-14 13:26:34,559 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 327 transitions. Word has length 111 [2024-10-14 13:26:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:34,560 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 327 transitions. [2024-10-14 13:26:34,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 327 transitions. [2024-10-14 13:26:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:34,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:34,561 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:26:34,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1454795104, now seen corresponding path program 1 times [2024-10-14 13:26:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391585978] [2024-10-14 13:26:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:35,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391585978] [2024-10-14 13:26:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391585978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:26:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886627012] [2024-10-14 13:26:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:26:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:26:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:26:35,491 INFO L87 Difference]: Start difference. First operand 235 states and 327 transitions. Second operand has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:26:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:35,955 INFO L93 Difference]: Finished difference Result 507 states and 705 transitions. [2024-10-14 13:26:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:26:35,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 111 [2024-10-14 13:26:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:35,957 INFO L225 Difference]: With dead ends: 507 [2024-10-14 13:26:35,958 INFO L226 Difference]: Without dead ends: 287 [2024-10-14 13:26:35,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:26:35,958 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 78 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:35,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 775 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:26:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-14 13:26:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-10-14 13:26:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 226 states have (on average 1.2920353982300885) internal successors, (292), 229 states have internal predecessors, (292), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-14 13:26:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2024-10-14 13:26:35,992 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 111 [2024-10-14 13:26:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2024-10-14 13:26:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.5) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:26:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2024-10-14 13:26:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 13:26:35,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:35,995 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:35,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:26:35,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:35,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash -753730526, now seen corresponding path program 1 times [2024-10-14 13:26:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343461740] [2024-10-14 13:26:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343461740] [2024-10-14 13:26:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343461740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:26:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573820140] [2024-10-14 13:26:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:26:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:26:36,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:36,679 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:36,955 INFO L93 Difference]: Finished difference Result 556 states and 771 transitions. [2024-10-14 13:26:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:26:36,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-14 13:26:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:36,958 INFO L225 Difference]: With dead ends: 556 [2024-10-14 13:26:36,958 INFO L226 Difference]: Without dead ends: 287 [2024-10-14 13:26:36,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:26:36,959 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 61 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:36,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 767 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:26:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-14 13:26:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-10-14 13:26:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 226 states have (on average 1.2876106194690264) internal successors, (291), 229 states have internal predecessors, (291), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-14 13:26:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 393 transitions. [2024-10-14 13:26:36,988 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 393 transitions. Word has length 111 [2024-10-14 13:26:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:36,989 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 393 transitions. [2024-10-14 13:26:36,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2024-10-14 13:26:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 13:26:36,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:36,990 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:36,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:26:36,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 695402590, now seen corresponding path program 1 times [2024-10-14 13:26:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498775873] [2024-10-14 13:26:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:37,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498775873] [2024-10-14 13:26:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498775873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:26:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520318060] [2024-10-14 13:26:37,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:26:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:26:37,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:26:37,240 INFO L87 Difference]: Start difference. First operand 284 states and 393 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:37,407 INFO L93 Difference]: Finished difference Result 541 states and 747 transitions. [2024-10-14 13:26:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-10-14 13:26:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:37,408 INFO L225 Difference]: With dead ends: 541 [2024-10-14 13:26:37,408 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 13:26:37,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:37,409 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 101 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:37,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 408 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 13:26:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2024-10-14 13:26:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 184 states have (on average 1.25) internal successors, (230), 186 states have internal predecessors, (230), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 13:26:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 322 transitions. [2024-10-14 13:26:37,432 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 322 transitions. Word has length 112 [2024-10-14 13:26:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:37,432 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 322 transitions. [2024-10-14 13:26:37,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 322 transitions. [2024-10-14 13:26:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 13:26:37,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:37,433 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:37,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:26:37,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash 996037289, now seen corresponding path program 1 times [2024-10-14 13:26:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421937828] [2024-10-14 13:26:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421937828] [2024-10-14 13:26:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421937828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:26:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900514198] [2024-10-14 13:26:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:38,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:38,074 INFO L87 Difference]: Start difference. First operand 237 states and 322 transitions. Second operand has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:38,422 INFO L93 Difference]: Finished difference Result 520 states and 708 transitions. [2024-10-14 13:26:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:38,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2024-10-14 13:26:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:38,424 INFO L225 Difference]: With dead ends: 520 [2024-10-14 13:26:38,424 INFO L226 Difference]: Without dead ends: 298 [2024-10-14 13:26:38,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:38,425 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 72 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:38,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 413 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-14 13:26:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2024-10-14 13:26:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 232 states have (on average 1.2586206896551724) internal successors, (292), 235 states have internal predecessors, (292), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-14 13:26:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 402 transitions. [2024-10-14 13:26:38,459 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 402 transitions. Word has length 112 [2024-10-14 13:26:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 402 transitions. [2024-10-14 13:26:38,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 402 transitions. [2024-10-14 13:26:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 13:26:38,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:38,461 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:38,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:26:38,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:38,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 294972711, now seen corresponding path program 1 times [2024-10-14 13:26:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717942824] [2024-10-14 13:26:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717942824] [2024-10-14 13:26:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717942824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:26:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741841294] [2024-10-14 13:26:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:38,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:26:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:26:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:26:38,931 INFO L87 Difference]: Start difference. First operand 295 states and 402 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:39,322 INFO L93 Difference]: Finished difference Result 599 states and 812 transitions. [2024-10-14 13:26:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:26:39,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-10-14 13:26:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:39,324 INFO L225 Difference]: With dead ends: 599 [2024-10-14 13:26:39,324 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 13:26:39,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:26:39,325 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 81 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:39,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 806 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 13:26:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2024-10-14 13:26:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 244 states have (on average 1.2418032786885247) internal successors, (303), 247 states have internal predecessors, (303), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 13:26:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 425 transitions. [2024-10-14 13:26:39,372 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 425 transitions. Word has length 112 [2024-10-14 13:26:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:39,373 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 425 transitions. [2024-10-14 13:26:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 425 transitions. [2024-10-14 13:26:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 13:26:39,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:39,374 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:26:39,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:39,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash -592310613, now seen corresponding path program 1 times [2024-10-14 13:26:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282537321] [2024-10-14 13:26:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282537321] [2024-10-14 13:26:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282537321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:39,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:26:39,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242230068] [2024-10-14 13:26:39,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:39,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:26:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:26:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:26:39,911 INFO L87 Difference]: Start difference. First operand 315 states and 425 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:40,328 INFO L93 Difference]: Finished difference Result 613 states and 825 transitions. [2024-10-14 13:26:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:26:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-10-14 13:26:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:40,330 INFO L225 Difference]: With dead ends: 613 [2024-10-14 13:26:40,330 INFO L226 Difference]: Without dead ends: 325 [2024-10-14 13:26:40,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:26:40,331 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:40,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 952 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-14 13:26:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2024-10-14 13:26:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 250 states have (on average 1.236) internal successors, (309), 253 states have internal predecessors, (309), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 13:26:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2024-10-14 13:26:40,365 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 112 [2024-10-14 13:26:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:40,365 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2024-10-14 13:26:40,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2024-10-14 13:26:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 13:26:40,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:40,366 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:26:40,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1293375191, now seen corresponding path program 1 times [2024-10-14 13:26:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:40,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243568442] [2024-10-14 13:26:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:40,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:40,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243568442] [2024-10-14 13:26:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243568442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:26:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225347120] [2024-10-14 13:26:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:40,920 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:41,302 INFO L93 Difference]: Finished difference Result 617 states and 826 transitions. [2024-10-14 13:26:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2024-10-14 13:26:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:41,305 INFO L225 Difference]: With dead ends: 617 [2024-10-14 13:26:41,305 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 13:26:41,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:26:41,306 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:41,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 597 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 13:26:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-10-14 13:26:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 247 states have (on average 1.2307692307692308) internal successors, (304), 250 states have internal predecessors, (304), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 13:26:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 426 transitions. [2024-10-14 13:26:41,352 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 426 transitions. Word has length 112 [2024-10-14 13:26:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:41,352 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 426 transitions. [2024-10-14 13:26:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 426 transitions. [2024-10-14 13:26:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 13:26:41,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:41,354 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:41,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:26:41,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1184079089, now seen corresponding path program 1 times [2024-10-14 13:26:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237939489] [2024-10-14 13:26:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237939489] [2024-10-14 13:26:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237939489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:41,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:41,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:26:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717205126] [2024-10-14 13:26:41,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:41,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:26:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:26:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:26:41,615 INFO L87 Difference]: Start difference. First operand 319 states and 426 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:41,812 INFO L93 Difference]: Finished difference Result 833 states and 1109 transitions. [2024-10-14 13:26:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:26:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-10-14 13:26:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:41,815 INFO L225 Difference]: With dead ends: 833 [2024-10-14 13:26:41,815 INFO L226 Difference]: Without dead ends: 541 [2024-10-14 13:26:41,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:26:41,817 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:41,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 540 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:26:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-14 13:26:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 451. [2024-10-14 13:26:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 357 states have (on average 1.2156862745098038) internal successors, (434), 362 states have internal predecessors, (434), 79 states have call successors, (79), 14 states have call predecessors, (79), 14 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-14 13:26:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 592 transitions. [2024-10-14 13:26:41,859 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 592 transitions. Word has length 113 [2024-10-14 13:26:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:41,859 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 592 transitions. [2024-10-14 13:26:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 592 transitions. [2024-10-14 13:26:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:26:41,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:41,861 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:26:41,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2126233590, now seen corresponding path program 1 times [2024-10-14 13:26:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626756656] [2024-10-14 13:26:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:26:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626756656] [2024-10-14 13:26:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626756656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:26:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134945692] [2024-10-14 13:26:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:26:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:43,215 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-10-14 13:26:43,216 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-10-14 13:26:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-14 13:26:43,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:26:43,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:43,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2024-10-14 13:26:43,929 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-10-14 13:26:44,107 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 31 treesize of output 15 [2024-10-14 13:26:44,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:44,291 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 1 case distinctions, treesize of input 42 treesize of output 29 [2024-10-14 13:26:44,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:44,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2024-10-14 13:26:44,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:44,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 52 [2024-10-14 13:26:50,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:26:50,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 47 [2024-10-14 13:26:50,159 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 41 treesize of output 29 [2024-10-14 13:26:50,167 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 38 treesize of output 26 [2024-10-14 13:26:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 321 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 13:26:50,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:26:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134945692] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:26:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:26:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13, 25] total 38 [2024-10-14 13:26:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772876010] [2024-10-14 13:26:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:26:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:26:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1223, Unknown=1, NotChecked=0, Total=1406 [2024-10-14 13:26:51,110 INFO L87 Difference]: Start difference. First operand 451 states and 592 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:51,785 INFO L93 Difference]: Finished difference Result 949 states and 1237 transitions. [2024-10-14 13:26:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-14 13:26:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:51,788 INFO L225 Difference]: With dead ends: 949 [2024-10-14 13:26:51,788 INFO L226 Difference]: Without dead ends: 525 [2024-10-14 13:26:51,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=200, Invalid=1359, Unknown=1, NotChecked=0, Total=1560 [2024-10-14 13:26:51,790 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 161 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:51,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 380 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:26:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-14 13:26:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 519. [2024-10-14 13:26:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 416 states have (on average 1.21875) internal successors, (507), 423 states have internal predecessors, (507), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-14 13:26:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 673 transitions. [2024-10-14 13:26:51,836 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 673 transitions. Word has length 114 [2024-10-14 13:26:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:51,837 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 673 transitions. [2024-10-14 13:26:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:26:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 673 transitions. [2024-10-14 13:26:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:26:51,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:51,838 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:51,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:26:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 13:26:52,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -683985001, now seen corresponding path program 1 times [2024-10-14 13:26:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:52,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094826664] [2024-10-14 13:26:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094826664] [2024-10-14 13:26:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094826664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:26:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028750651] [2024-10-14 13:26:53,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:53,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:26:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:53,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:26:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:26:53,012 INFO L87 Difference]: Start difference. First operand 519 states and 673 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:54,306 INFO L93 Difference]: Finished difference Result 1013 states and 1313 transitions. [2024-10-14 13:26:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:26:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-10-14 13:26:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:54,309 INFO L225 Difference]: With dead ends: 1013 [2024-10-14 13:26:54,309 INFO L226 Difference]: Without dead ends: 525 [2024-10-14 13:26:54,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-14 13:26:54,310 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 145 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:54,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 709 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 13:26:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-14 13:26:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 519. [2024-10-14 13:26:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 416 states have (on average 1.2139423076923077) internal successors, (505), 423 states have internal predecessors, (505), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-14 13:26:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 671 transitions. [2024-10-14 13:26:54,353 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 671 transitions. Word has length 115 [2024-10-14 13:26:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:54,354 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 671 transitions. [2024-10-14 13:26:54,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 671 transitions. [2024-10-14 13:26:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:26:54,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:54,355 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:54,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:26:54,355 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:54,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1889182760, now seen corresponding path program 1 times [2024-10-14 13:26:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:54,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363861173] [2024-10-14 13:26:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363861173] [2024-10-14 13:26:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363861173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:54,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:26:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030051907] [2024-10-14 13:26:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:54,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:26:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:54,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:26:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:54,976 INFO L87 Difference]: Start difference. First operand 519 states and 671 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:55,329 INFO L93 Difference]: Finished difference Result 527 states and 679 transitions. [2024-10-14 13:26:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:26:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2024-10-14 13:26:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:55,331 INFO L225 Difference]: With dead ends: 527 [2024-10-14 13:26:55,331 INFO L226 Difference]: Without dead ends: 525 [2024-10-14 13:26:55,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:26:55,332 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:55,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 593 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:26:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-14 13:26:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2024-10-14 13:26:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 420 states have (on average 1.2119047619047618) internal successors, (509), 427 states have internal predecessors, (509), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-14 13:26:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 675 transitions. [2024-10-14 13:26:55,378 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 675 transitions. Word has length 115 [2024-10-14 13:26:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:55,378 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 675 transitions. [2024-10-14 13:26:55,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 675 transitions. [2024-10-14 13:26:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:26:55,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:55,379 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:26:55,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1889123178, now seen corresponding path program 1 times [2024-10-14 13:26:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148962262] [2024-10-14 13:26:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:56,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:56,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148962262] [2024-10-14 13:26:56,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148962262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:56,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:26:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927605675] [2024-10-14 13:26:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:26:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:26:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:26:56,120 INFO L87 Difference]: Start difference. First operand 523 states and 675 transitions. Second operand has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:56,880 INFO L93 Difference]: Finished difference Result 1509 states and 1949 transitions. [2024-10-14 13:26:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 13:26:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-10-14 13:26:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:56,884 INFO L225 Difference]: With dead ends: 1509 [2024-10-14 13:26:56,884 INFO L226 Difference]: Without dead ends: 1017 [2024-10-14 13:26:56,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:26:56,885 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 180 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:56,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 654 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:26:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-10-14 13:26:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 718. [2024-10-14 13:26:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 615 states have (on average 1.2373983739837398) internal successors, (761), 622 states have internal predecessors, (761), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-14 13:26:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 927 transitions. [2024-10-14 13:26:56,944 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 927 transitions. Word has length 115 [2024-10-14 13:26:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:56,945 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 927 transitions. [2024-10-14 13:26:56,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:26:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 927 transitions. [2024-10-14 13:26:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:26:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:56,946 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 13:26:56,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 308272408, now seen corresponding path program 1 times [2024-10-14 13:26:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197534721] [2024-10-14 13:26:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:26:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:26:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:26:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:26:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:26:57,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:57,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197534721] [2024-10-14 13:26:57,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197534721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:57,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:57,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:26:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792106839] [2024-10-14 13:26:57,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:57,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:26:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:57,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:26:57,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:26:57,523 INFO L87 Difference]: Start difference. First operand 718 states and 927 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:57,823 INFO L93 Difference]: Finished difference Result 744 states and 958 transitions. [2024-10-14 13:26:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:26:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2024-10-14 13:26:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:57,826 INFO L225 Difference]: With dead ends: 744 [2024-10-14 13:26:57,826 INFO L226 Difference]: Without dead ends: 742 [2024-10-14 13:26:57,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:26:57,827 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 75 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:57,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 488 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:26:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-14 13:26:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 685. [2024-10-14 13:26:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 585 states have (on average 1.2273504273504274) internal successors, (718), 592 states have internal predecessors, (718), 79 states have call successors, (79), 20 states have call predecessors, (79), 20 states have return successors, (79), 72 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-14 13:26:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 876 transitions. [2024-10-14 13:26:57,883 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 876 transitions. Word has length 115 [2024-10-14 13:26:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:57,883 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 876 transitions. [2024-10-14 13:26:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:26:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 876 transitions. [2024-10-14 13:26:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:26:57,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:57,884 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:26:57,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:26:57,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:57,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash 876300398, now seen corresponding path program 1 times [2024-10-14 13:26:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521616550] [2024-10-14 13:26:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:27:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521616550] [2024-10-14 13:27:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521616550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116558725] [2024-10-14 13:27:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:00,085 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-10-14 13:27:00,086 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-10-14 13:27:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:00,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-14 13:27:00,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:00,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 10 [2024-10-14 13:27:00,959 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 7 treesize of output 3 [2024-10-14 13:27:00,975 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-10-14 13:27:01,190 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 31 treesize of output 15 [2024-10-14 13:27:01,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:01,687 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 1 case distinctions, treesize of input 53 treesize of output 34 [2024-10-14 13:27:02,693 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-10-14 13:27:02,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 57 [2024-10-14 13:27:03,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:03,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 66 [2024-10-14 13:27:04,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:04,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 62 [2024-10-14 13:27:05,022 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 46 treesize of output 30 [2024-10-14 13:27:05,029 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 36 treesize of output 24 [2024-10-14 13:27:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 326 proven. 54 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 13:27:05,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:27:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116558725] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:06,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:27:06,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 31] total 50 [2024-10-14 13:27:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836626732] [2024-10-14 13:27:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:06,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:27:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:27:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:27:06,158 INFO L87 Difference]: Start difference. First operand 685 states and 876 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:06,963 INFO L93 Difference]: Finished difference Result 1336 states and 1694 transitions. [2024-10-14 13:27:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:27:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:06,968 INFO L225 Difference]: With dead ends: 1336 [2024-10-14 13:27:06,968 INFO L226 Difference]: Without dead ends: 670 [2024-10-14 13:27:06,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=288, Invalid=2364, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 13:27:06,970 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 85 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:06,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 377 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:27:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-14 13:27:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 568. [2024-10-14 13:27:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 477 states have (on average 1.1949685534591195) internal successors, (570), 481 states have internal predecessors, (570), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 710 transitions. [2024-10-14 13:27:07,044 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 710 transitions. Word has length 116 [2024-10-14 13:27:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 710 transitions. [2024-10-14 13:27:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 710 transitions. [2024-10-14 13:27:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:07,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:07,046 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:07,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:27:07,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:07,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:07,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1691077145, now seen corresponding path program 1 times [2024-10-14 13:27:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:07,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202110295] [2024-10-14 13:27:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202110295] [2024-10-14 13:27:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202110295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:07,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868881564] [2024-10-14 13:27:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:07,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:07,676 INFO L87 Difference]: Start difference. First operand 568 states and 710 transitions. Second operand has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:27:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:08,110 INFO L93 Difference]: Finished difference Result 1177 states and 1458 transitions. [2024-10-14 13:27:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:27:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2024-10-14 13:27:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:08,112 INFO L225 Difference]: With dead ends: 1177 [2024-10-14 13:27:08,112 INFO L226 Difference]: Without dead ends: 610 [2024-10-14 13:27:08,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:27:08,114 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 103 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:08,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 681 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:27:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-14 13:27:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 546. [2024-10-14 13:27:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 455 states have (on average 1.1736263736263737) internal successors, (534), 459 states have internal predecessors, (534), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 674 transitions. [2024-10-14 13:27:08,169 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 674 transitions. Word has length 116 [2024-10-14 13:27:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:08,169 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 674 transitions. [2024-10-14 13:27:08,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:27:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 674 transitions. [2024-10-14 13:27:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:27:08,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:08,170 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:08,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:27:08,170 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 52812105, now seen corresponding path program 1 times [2024-10-14 13:27:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281260001] [2024-10-14 13:27:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281260001] [2024-10-14 13:27:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281260001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:27:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525026114] [2024-10-14 13:27:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:08,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:27:08,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:27:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:08,758 INFO L87 Difference]: Start difference. First operand 546 states and 674 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:09,304 INFO L93 Difference]: Finished difference Result 1147 states and 1409 transitions. [2024-10-14 13:27:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:27:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:27:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:09,307 INFO L225 Difference]: With dead ends: 1147 [2024-10-14 13:27:09,307 INFO L226 Difference]: Without dead ends: 602 [2024-10-14 13:27:09,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:09,312 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:09,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 366 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:27:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-14 13:27:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 546. [2024-10-14 13:27:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 455 states have (on average 1.167032967032967) internal successors, (531), 459 states have internal predecessors, (531), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 671 transitions. [2024-10-14 13:27:09,373 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 671 transitions. Word has length 117 [2024-10-14 13:27:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:09,373 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 671 transitions. [2024-10-14 13:27:09,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 671 transitions. [2024-10-14 13:27:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:27:09,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:09,374 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:09,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 13:27:09,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 95363765, now seen corresponding path program 1 times [2024-10-14 13:27:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291161681] [2024-10-14 13:27:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:09,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291161681] [2024-10-14 13:27:09,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291161681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:27:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391147349] [2024-10-14 13:27:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:27:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:27:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:09,608 INFO L87 Difference]: Start difference. First operand 546 states and 671 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:09,850 INFO L93 Difference]: Finished difference Result 1353 states and 1656 transitions. [2024-10-14 13:27:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:27:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:27:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:09,854 INFO L225 Difference]: With dead ends: 1353 [2024-10-14 13:27:09,854 INFO L226 Difference]: Without dead ends: 808 [2024-10-14 13:27:09,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:27:09,855 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:09,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 678 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-14 13:27:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 621. [2024-10-14 13:27:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 530 states have (on average 1.1660377358490566) internal successors, (618), 534 states have internal predecessors, (618), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 758 transitions. [2024-10-14 13:27:09,920 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 758 transitions. Word has length 117 [2024-10-14 13:27:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:09,921 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 758 transitions. [2024-10-14 13:27:09,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 758 transitions. [2024-10-14 13:27:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:27:09,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:09,921 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:09,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 13:27:09,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash -425145827, now seen corresponding path program 1 times [2024-10-14 13:27:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899690082] [2024-10-14 13:27:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899690082] [2024-10-14 13:27:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899690082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:10,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:27:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838021035] [2024-10-14 13:27:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:27:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:27:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:27:10,410 INFO L87 Difference]: Start difference. First operand 621 states and 758 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:10,747 INFO L93 Difference]: Finished difference Result 1295 states and 1579 transitions. [2024-10-14 13:27:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:27:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-14 13:27:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:10,750 INFO L225 Difference]: With dead ends: 1295 [2024-10-14 13:27:10,750 INFO L226 Difference]: Without dead ends: 675 [2024-10-14 13:27:10,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:27:10,752 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 24 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:10,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 581 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-14 13:27:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 627. [2024-10-14 13:27:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 536 states have (on average 1.1529850746268657) internal successors, (618), 540 states have internal predecessors, (618), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 758 transitions. [2024-10-14 13:27:10,823 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 758 transitions. Word has length 122 [2024-10-14 13:27:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 758 transitions. [2024-10-14 13:27:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 758 transitions. [2024-10-14 13:27:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:27:10,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:10,824 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 13:27:10,824 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1093029139, now seen corresponding path program 1 times [2024-10-14 13:27:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416162805] [2024-10-14 13:27:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416162805] [2024-10-14 13:27:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416162805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:27:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992156061] [2024-10-14 13:27:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:27:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:27:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:11,221 INFO L87 Difference]: Start difference. First operand 627 states and 758 transitions. Second operand has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:27:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:11,485 INFO L93 Difference]: Finished difference Result 1319 states and 1587 transitions. [2024-10-14 13:27:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:27:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2024-10-14 13:27:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:11,488 INFO L225 Difference]: With dead ends: 1319 [2024-10-14 13:27:11,488 INFO L226 Difference]: Without dead ends: 693 [2024-10-14 13:27:11,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:27:11,489 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 44 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:11,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 541 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-14 13:27:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 627. [2024-10-14 13:27:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 536 states have (on average 1.1417910447761195) internal successors, (612), 540 states have internal predecessors, (612), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 752 transitions. [2024-10-14 13:27:11,549 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 752 transitions. Word has length 122 [2024-10-14 13:27:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:11,550 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 752 transitions. [2024-10-14 13:27:11,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:27:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 752 transitions. [2024-10-14 13:27:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:27:11,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:11,551 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 13:27:11,551 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:11,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1794093717, now seen corresponding path program 1 times [2024-10-14 13:27:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461921184] [2024-10-14 13:27:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:11,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461921184] [2024-10-14 13:27:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461921184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:11,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:27:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416257965] [2024-10-14 13:27:11,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:11,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:27:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:27:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:11,736 INFO L87 Difference]: Start difference. First operand 627 states and 752 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:11,866 INFO L93 Difference]: Finished difference Result 1281 states and 1533 transitions. [2024-10-14 13:27:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:27:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-14 13:27:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:11,869 INFO L225 Difference]: With dead ends: 1281 [2024-10-14 13:27:11,869 INFO L226 Difference]: Without dead ends: 655 [2024-10-14 13:27:11,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:11,870 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 33 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:11,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 574 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-14 13:27:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 621. [2024-10-14 13:27:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 530 states have (on average 1.1320754716981132) internal successors, (600), 534 states have internal predecessors, (600), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 740 transitions. [2024-10-14 13:27:11,950 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 740 transitions. Word has length 122 [2024-10-14 13:27:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:11,950 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 740 transitions. [2024-10-14 13:27:11,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 740 transitions. [2024-10-14 13:27:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:27:11,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:11,955 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 13:27:11,955 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:11,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1987876225, now seen corresponding path program 1 times [2024-10-14 13:27:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312872352] [2024-10-14 13:27:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:27:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312872352] [2024-10-14 13:27:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312872352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158972007] [2024-10-14 13:27:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:24,552 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-10-14 13:27:24,552 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-10-14 13:27:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:25,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 13:27:25,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:25,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:25,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2024-10-14 13:27:25,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 13:27:25,366 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-10-14 13:27:25,568 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 99 treesize of output 69 [2024-10-14 13:27:25,570 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 73 treesize of output 61 [2024-10-14 13:27:25,677 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 65 treesize of output 45 [2024-10-14 13:27:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:27:25,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:27:30,577 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 29 treesize of output 21 [2024-10-14 13:27:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158972007] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:30,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:27:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [29, 15] total 40 [2024-10-14 13:27:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076272172] [2024-10-14 13:27:30,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:30,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 13:27:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:30,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 13:27:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1456, Unknown=1, NotChecked=0, Total=1560 [2024-10-14 13:27:30,952 INFO L87 Difference]: Start difference. First operand 621 states and 740 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:32,342 INFO L93 Difference]: Finished difference Result 1579 states and 1870 transitions. [2024-10-14 13:27:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:27:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-10-14 13:27:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:32,347 INFO L225 Difference]: With dead ends: 1579 [2024-10-14 13:27:32,347 INFO L226 Difference]: Without dead ends: 959 [2024-10-14 13:27:32,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=145, Invalid=2206, Unknown=1, NotChecked=0, Total=2352 [2024-10-14 13:27:32,351 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 73 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:32,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1259 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:27:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-14 13:27:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 756. [2024-10-14 13:27:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 665 states have (on average 1.130827067669173) internal successors, (752), 669 states have internal predecessors, (752), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 13:27:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 892 transitions. [2024-10-14 13:27:32,433 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 892 transitions. Word has length 127 [2024-10-14 13:27:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:32,433 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 892 transitions. [2024-10-14 13:27:32,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 892 transitions. [2024-10-14 13:27:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:27:32,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:32,434 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:32,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 13:27:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:32,635 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:32,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1729710787, now seen corresponding path program 1 times [2024-10-14 13:27:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964044258] [2024-10-14 13:27:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:33,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:33,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964044258] [2024-10-14 13:27:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964044258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559795551] [2024-10-14 13:27:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:33,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:33,043 INFO L87 Difference]: Start difference. First operand 756 states and 892 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:33,943 INFO L93 Difference]: Finished difference Result 1755 states and 2066 transitions. [2024-10-14 13:27:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:27:33,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-10-14 13:27:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:33,947 INFO L225 Difference]: With dead ends: 1755 [2024-10-14 13:27:33,947 INFO L226 Difference]: Without dead ends: 1000 [2024-10-14 13:27:33,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:27:33,949 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 147 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:33,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 570 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:27:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-10-14 13:27:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 739. [2024-10-14 13:27:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 639 states have (on average 1.1189358372456963) internal successors, (715), 642 states have internal predecessors, (715), 76 states have call successors, (76), 23 states have call predecessors, (76), 23 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 13:27:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 867 transitions. [2024-10-14 13:27:34,050 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 867 transitions. Word has length 127 [2024-10-14 13:27:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:34,050 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 867 transitions. [2024-10-14 13:27:34,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 867 transitions. [2024-10-14 13:27:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:27:34,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:34,052 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:34,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 13:27:34,052 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1925836611, now seen corresponding path program 1 times [2024-10-14 13:27:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677324730] [2024-10-14 13:27:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677324730] [2024-10-14 13:27:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677324730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:27:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492746844] [2024-10-14 13:27:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:27:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:34,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:27:34,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:27:34,352 INFO L87 Difference]: Start difference. First operand 739 states and 867 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:34,832 INFO L93 Difference]: Finished difference Result 1423 states and 1674 transitions. [2024-10-14 13:27:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:27:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-10-14 13:27:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:34,835 INFO L225 Difference]: With dead ends: 1423 [2024-10-14 13:27:34,835 INFO L226 Difference]: Without dead ends: 685 [2024-10-14 13:27:34,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:27:34,837 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 164 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:34,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 879 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:27:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-14 13:27:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-10-14 13:27:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 585 states have (on average 1.1076923076923078) internal successors, (648), 588 states have internal predecessors, (648), 76 states have call successors, (76), 23 states have call predecessors, (76), 23 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 13:27:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 800 transitions. [2024-10-14 13:27:34,936 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 800 transitions. Word has length 127 [2024-10-14 13:27:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:34,937 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 800 transitions. [2024-10-14 13:27:34,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 800 transitions. [2024-10-14 13:27:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:34,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:34,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:34,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 13:27:34,938 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:34,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -255023038, now seen corresponding path program 1 times [2024-10-14 13:27:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546192983] [2024-10-14 13:27:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546192983] [2024-10-14 13:27:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546192983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353695061] [2024-10-14 13:27:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:35,165 INFO L87 Difference]: Start difference. First operand 685 states and 800 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:35,544 INFO L93 Difference]: Finished difference Result 1658 states and 1930 transitions. [2024-10-14 13:27:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-14 13:27:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:35,548 INFO L225 Difference]: With dead ends: 1658 [2024-10-14 13:27:35,548 INFO L226 Difference]: Without dead ends: 974 [2024-10-14 13:27:35,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-10-14 13:27:35,549 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 60 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:35,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 414 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-14 13:27:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 817. [2024-10-14 13:27:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 702 states have (on average 1.101139601139601) internal successors, (773), 706 states have internal predecessors, (773), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 947 transitions. [2024-10-14 13:27:35,662 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 947 transitions. Word has length 128 [2024-10-14 13:27:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:35,663 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 947 transitions. [2024-10-14 13:27:35,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 947 transitions. [2024-10-14 13:27:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:35,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:35,664 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:35,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 13:27:35,664 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:35,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash -451148862, now seen corresponding path program 1 times [2024-10-14 13:27:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:35,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831217137] [2024-10-14 13:27:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831217137] [2024-10-14 13:27:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831217137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331713269] [2024-10-14 13:27:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:35,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:35,858 INFO L87 Difference]: Start difference. First operand 817 states and 947 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:36,216 INFO L93 Difference]: Finished difference Result 1655 states and 1921 transitions. [2024-10-14 13:27:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:36,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-14 13:27:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:36,220 INFO L225 Difference]: With dead ends: 1655 [2024-10-14 13:27:36,220 INFO L226 Difference]: Without dead ends: 839 [2024-10-14 13:27:36,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-10-14 13:27:36,223 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 69 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:36,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 415 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-14 13:27:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 779. [2024-10-14 13:27:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 664 states have (on average 1.0978915662650603) internal successors, (729), 668 states have internal predecessors, (729), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 903 transitions. [2024-10-14 13:27:36,341 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 903 transitions. Word has length 128 [2024-10-14 13:27:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:36,341 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 903 transitions. [2024-10-14 13:27:36,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 903 transitions. [2024-10-14 13:27:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:36,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:36,342 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:36,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 13:27:36,342 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -764496128, now seen corresponding path program 1 times [2024-10-14 13:27:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82713915] [2024-10-14 13:27:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82713915] [2024-10-14 13:27:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82713915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:36,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:36,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:27:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276825176] [2024-10-14 13:27:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:27:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:27:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:36,642 INFO L87 Difference]: Start difference. First operand 779 states and 903 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:37,184 INFO L93 Difference]: Finished difference Result 1600 states and 1857 transitions. [2024-10-14 13:27:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:27:37,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-14 13:27:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:37,187 INFO L225 Difference]: With dead ends: 1600 [2024-10-14 13:27:37,187 INFO L226 Difference]: Without dead ends: 822 [2024-10-14 13:27:37,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:37,189 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 180 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:37,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 490 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:27:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-14 13:27:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 711. [2024-10-14 13:27:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 596 states have (on average 1.0855704697986577) internal successors, (647), 600 states have internal predecessors, (647), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 821 transitions. [2024-10-14 13:27:37,319 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 821 transitions. Word has length 128 [2024-10-14 13:27:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:37,319 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 821 transitions. [2024-10-14 13:27:37,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 821 transitions. [2024-10-14 13:27:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:37,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:37,320 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:37,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 13:27:37,321 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -960621952, now seen corresponding path program 1 times [2024-10-14 13:27:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669132639] [2024-10-14 13:27:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669132639] [2024-10-14 13:27:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669132639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:27:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663006654] [2024-10-14 13:27:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:27:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:27:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:27:37,990 INFO L87 Difference]: Start difference. First operand 711 states and 821 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:38,808 INFO L93 Difference]: Finished difference Result 1549 states and 1782 transitions. [2024-10-14 13:27:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 13:27:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-14 13:27:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:38,812 INFO L225 Difference]: With dead ends: 1549 [2024-10-14 13:27:38,812 INFO L226 Difference]: Without dead ends: 839 [2024-10-14 13:27:38,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:27:38,814 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 155 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:38,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 683 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:27:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-14 13:27:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 711. [2024-10-14 13:27:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 596 states have (on average 1.082214765100671) internal successors, (645), 600 states have internal predecessors, (645), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 819 transitions. [2024-10-14 13:27:38,948 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 819 transitions. Word has length 128 [2024-10-14 13:27:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 819 transitions. [2024-10-14 13:27:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 819 transitions. [2024-10-14 13:27:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:38,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:38,949 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 13:27:38,949 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1971739202, now seen corresponding path program 1 times [2024-10-14 13:27:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669032164] [2024-10-14 13:27:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:39,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:39,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669032164] [2024-10-14 13:27:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669032164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:39,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 13:27:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327319568] [2024-10-14 13:27:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:27:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:27:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:27:39,947 INFO L87 Difference]: Start difference. First operand 711 states and 819 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:27:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:41,206 INFO L93 Difference]: Finished difference Result 1600 states and 1836 transitions. [2024-10-14 13:27:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 13:27:41,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2024-10-14 13:27:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:41,210 INFO L225 Difference]: With dead ends: 1600 [2024-10-14 13:27:41,210 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 13:27:41,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:27:41,211 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 194 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:41,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 971 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 13:27:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 13:27:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 720. [2024-10-14 13:27:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 605 states have (on average 1.08099173553719) internal successors, (654), 609 states have internal predecessors, (654), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 828 transitions. [2024-10-14 13:27:41,341 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 828 transitions. Word has length 128 [2024-10-14 13:27:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:41,341 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 828 transitions. [2024-10-14 13:27:41,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:27:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 828 transitions. [2024-10-14 13:27:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:41,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:41,342 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:41,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 13:27:41,342 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1713573764, now seen corresponding path program 1 times [2024-10-14 13:27:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373151074] [2024-10-14 13:27:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:27:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373151074] [2024-10-14 13:27:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373151074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860713289] [2024-10-14 13:27:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:41,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:41,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:41,692 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-10-14 13:27:41,693 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-10-14 13:27:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-14 13:27:42,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:42,143 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 9 treesize of output 3 [2024-10-14 13:27:42,417 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 42 treesize of output 20 [2024-10-14 13:27:42,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:42,816 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 1 case distinctions, treesize of input 64 treesize of output 43 [2024-10-14 13:27:42,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:42,957 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 1 case distinctions, treesize of input 78 treesize of output 47 [2024-10-14 13:27:43,257 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 29 treesize of output 25 [2024-10-14 13:27:43,519 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 31 treesize of output 19 [2024-10-14 13:27:43,621 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 33 treesize of output 25 [2024-10-14 13:27:43,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:43,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 96 treesize of output 42 [2024-10-14 13:27:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 290 proven. 75 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 13:27:44,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:27:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860713289] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:27:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:27:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10, 35] total 53 [2024-10-14 13:27:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403693491] [2024-10-14 13:27:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 13:27:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:44,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 13:27:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2541, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 13:27:44,964 INFO L87 Difference]: Start difference. First operand 720 states and 828 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:46,271 INFO L93 Difference]: Finished difference Result 1516 states and 1742 transitions. [2024-10-14 13:27:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 13:27:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-14 13:27:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:46,274 INFO L225 Difference]: With dead ends: 1516 [2024-10-14 13:27:46,274 INFO L226 Difference]: Without dead ends: 797 [2024-10-14 13:27:46,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=3839, Unknown=0, NotChecked=0, Total=4160 [2024-10-14 13:27:46,276 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:46,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1388 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:27:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-14 13:27:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 729. [2024-10-14 13:27:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 614 states have (on average 1.0814332247557004) internal successors, (664), 618 states have internal predecessors, (664), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-14 13:27:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 838 transitions. [2024-10-14 13:27:46,414 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 838 transitions. Word has length 128 [2024-10-14 13:27:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 838 transitions. [2024-10-14 13:27:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 838 transitions. [2024-10-14 13:27:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:27:46,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:46,415 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:27:46,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 13:27:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:46,616 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1621423934, now seen corresponding path program 1 times [2024-10-14 13:27:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105059010] [2024-10-14 13:27:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:27:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:27:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:27:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:27:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:27:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:27:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:27:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:27:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:27:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:27:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:27:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105059010] [2024-10-14 13:27:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105059010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:27:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030436287] [2024-10-14 13:27:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:27:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:27:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:27:47,487 INFO L87 Difference]: Start difference. First operand 729 states and 838 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15)