./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-ap_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:29:41,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:29:41,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:29:41,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:29:41,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:29:41,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:29:41,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:29:41,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:29:41,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:29:41,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:29:41,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:29:41,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:29:41,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:29:41,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:29:41,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:29:41,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:29:41,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:29:41,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:29:41,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:29:41,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:29:41,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:29:41,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:29:41,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:29:41,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:29:41,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:29:41,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:29:41,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:29:41,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:29:41,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:29:41,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:29:41,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:29:41,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:29:41,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:41,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:29:41,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:29:41,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:29:41,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:29:41,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:29:41,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:29:41,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:29:41,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:29:41,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:29:41,458 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-clean/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-clean/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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2024-10-11 13:29:41,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:29:41,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:29:41,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:29:41,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:29:41,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:29:41,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-11 13:29:43,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:29:43,478 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:29:43,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-11 13:29:43,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0844c48fc/98b054b41eac48179ca9b3c8e47ff478/FLAGe54df9e8d [2024-10-11 13:29:43,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0844c48fc/98b054b41eac48179ca9b3c8e47ff478 [2024-10-11 13:29:43,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:29:43,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:29:43,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:43,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:29:43,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:29:43,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:43,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6b8e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43, skipping insertion in model container [2024-10-11 13:29:43,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:43,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:29:43,727 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-ap_file-62.i[917,930] [2024-10-11 13:29:43,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:43,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:29:43,860 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-ap_file-62.i[917,930] [2024-10-11 13:29:43,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:43,915 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:29:43,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43 WrapperNode [2024-10-11 13:29:43,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:43,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:43,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:29:43,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:29:43,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:43,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:43,977 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2024-10-11 13:29:43,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:43,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:29:43,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:29:43,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:29:43,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:43,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,027 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2024-10-11 13:29:44,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:29:44,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:29:44,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:29:44,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:29:44,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (1/1) ... [2024-10-11 13:29:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:29:44,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:29:44,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:29:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:29:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:29:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:29:44,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:29:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:29:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:29:44,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:29:44,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:29:44,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:29:44,712 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-11 13:29:44,712 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:29:44,758 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:29:44,758 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:29:44,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:44 BoogieIcfgContainer [2024-10-11 13:29:44,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:29:44,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:29:44,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:29:44,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:29:44,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:29:43" (1/3) ... [2024-10-11 13:29:44,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8721488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:44, skipping insertion in model container [2024-10-11 13:29:44,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:43" (2/3) ... [2024-10-11 13:29:44,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8721488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:44, skipping insertion in model container [2024-10-11 13:29:44,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:44" (3/3) ... [2024-10-11 13:29:44,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-11 13:29:44,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:29:44,785 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:29:44,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:29:44,856 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;@6c9b91f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:29:44,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:29:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:29:44,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:44,873 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:44,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:44,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash 679761065, now seen corresponding path program 1 times [2024-10-11 13:29:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:44,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952131825] [2024-10-11 13:29:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:45,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952131825] [2024-10-11 13:29:45,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952131825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:45,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:45,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:29:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346682] [2024-10-11 13:29:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:45,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:29:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:29:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:29:45,255 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:29:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:45,296 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-11 13:29:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:29:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-11 13:29:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:45,306 INFO L225 Difference]: With dead ends: 129 [2024-10-11 13:29:45,307 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 13:29:45,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:29:45,313 INFO L432 NwaCegarLoop]: 88 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, 88 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-11 13:29:45,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 13:29:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 13:29:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-11 13:29:45,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-11 13:29:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:45,355 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-11 13:29:45,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:29:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-11 13:29:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:29:45,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:45,358 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:29:45,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash 619301017, now seen corresponding path program 1 times [2024-10-11 13:29:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44956929] [2024-10-11 13:29:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44956929] [2024-10-11 13:29:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44956929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290183640] [2024-10-11 13:29:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:45,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:45,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:45,706 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:45,759 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-11 13:29:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-11 13:29:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:45,763 INFO L225 Difference]: With dead ends: 130 [2024-10-11 13:29:45,763 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 13:29:45,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-11 13:29:45,766 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:45,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 13:29:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 13:29:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-11 13:29:45,775 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-11 13:29:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:45,776 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-11 13:29:45,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-11 13:29:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:29:45,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:45,778 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:29:45,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:45,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 676559319, now seen corresponding path program 1 times [2024-10-11 13:29:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93683541] [2024-10-11 13:29:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93683541] [2024-10-11 13:29:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93683541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196185214] [2024-10-11 13:29:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:45,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:45,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:45,976 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:46,024 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-11 13:29:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-11 13:29:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:46,029 INFO L225 Difference]: With dead ends: 134 [2024-10-11 13:29:46,029 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 13:29:46,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-11 13:29:46,030 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:46,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 13:29:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-11 13:29:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-11 13:29:46,041 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-11 13:29:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:46,042 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-11 13:29:46,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-11 13:29:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:29:46,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:46,045 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:46,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:29:46,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:46,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash 676618901, now seen corresponding path program 1 times [2024-10-11 13:29:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828672756] [2024-10-11 13:29:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:46,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828672756] [2024-10-11 13:29:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828672756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:29:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724434963] [2024-10-11 13:29:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:29:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:29:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:46,552 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:46,735 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-10-11 13:29:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-11 13:29:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:46,741 INFO L225 Difference]: With dead ends: 144 [2024-10-11 13:29:46,741 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 13:29:46,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:29:46,742 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:46,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 178 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 13:29:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-11 13:29:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 64 states have internal predecessors, (84), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-11 13:29:46,761 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 68 [2024-10-11 13:29:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:46,762 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-11 13:29:46,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-11 13:29:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:29:46,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:46,765 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:46,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:29:46,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:46,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -707403974, now seen corresponding path program 1 times [2024-10-11 13:29:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912201405] [2024-10-11 13:29:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912201405] [2024-10-11 13:29:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912201405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:29:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861526730] [2024-10-11 13:29:47,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:47,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:29:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:47,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:29:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:47,013 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:47,147 INFO L93 Difference]: Finished difference Result 198 states and 269 transitions. [2024-10-11 13:29:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:29:47,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-10-11 13:29:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:47,150 INFO L225 Difference]: With dead ends: 198 [2024-10-11 13:29:47,150 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 13:29:47,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-11 13:29:47,152 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 58 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:47,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 480 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 13:29:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2024-10-11 13:29:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-11 13:29:47,166 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 70 [2024-10-11 13:29:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:47,167 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-11 13:29:47,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-11 13:29:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:29:47,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:47,171 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:47,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:29:47,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:47,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash -746674476, now seen corresponding path program 1 times [2024-10-11 13:29:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027017278] [2024-10-11 13:29:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027017278] [2024-10-11 13:29:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027017278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:47,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691073850] [2024-10-11 13:29:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:47,438 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:47,515 INFO L93 Difference]: Finished difference Result 200 states and 273 transitions. [2024-10-11 13:29:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-11 13:29:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:47,517 INFO L225 Difference]: With dead ends: 200 [2024-10-11 13:29:47,517 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 13:29:47,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:29:47,518 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:47,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 445 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 13:29:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2024-10-11 13:29:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-10-11 13:29:47,528 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 72 [2024-10-11 13:29:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:47,529 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-10-11 13:29:47,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-10-11 13:29:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:29:47,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:47,530 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:29:47,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1499775503, now seen corresponding path program 1 times [2024-10-11 13:29:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251826444] [2024-10-11 13:29:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:47,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251826444] [2024-10-11 13:29:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251826444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877685350] [2024-10-11 13:29:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:47,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:47,686 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:47,725 INFO L93 Difference]: Finished difference Result 170 states and 231 transitions. [2024-10-11 13:29:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-11 13:29:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:47,727 INFO L225 Difference]: With dead ends: 170 [2024-10-11 13:29:47,727 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 13:29:47,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:47,730 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:47,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 13:29:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 13:29:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-11 13:29:47,746 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 72 [2024-10-11 13:29:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:47,747 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-11 13:29:47,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-11 13:29:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 13:29:47,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:47,749 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:29:47,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:47,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 300332512, now seen corresponding path program 1 times [2024-10-11 13:29:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624814645] [2024-10-11 13:29:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624814645] [2024-10-11 13:29:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624814645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875494005] [2024-10-11 13:29:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:47,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:47,934 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:48,018 INFO L93 Difference]: Finished difference Result 204 states and 273 transitions. [2024-10-11 13:29:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-11 13:29:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:48,020 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:29:48,020 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:29:48,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:29:48,021 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:48,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:29:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2024-10-11 13:29:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-10-11 13:29:48,041 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2024-10-11 13:29:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:48,042 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-11 13:29:48,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-10-11 13:29:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:29:48,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:48,043 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:48,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:29:48,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1216085754, now seen corresponding path program 1 times [2024-10-11 13:29:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377384858] [2024-10-11 13:29:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377384858] [2024-10-11 13:29:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377384858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:29:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855181347] [2024-10-11 13:29:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:49,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:29:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:29:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:29:49,145 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:49,876 INFO L93 Difference]: Finished difference Result 229 states and 303 transitions. [2024-10-11 13:29:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:29:49,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-11 13:29:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:49,878 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:29:49,878 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 13:29:49,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:29:49,879 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:49,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 809 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:29:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 13:29:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2024-10-11 13:29:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.313953488372093) internal successors, (113), 87 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:29:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2024-10-11 13:29:49,895 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 74 [2024-10-11 13:29:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:49,895 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2024-10-11 13:29:49,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2024-10-11 13:29:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:29:49,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:49,897 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:29:49,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 204968504, now seen corresponding path program 1 times [2024-10-11 13:29:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495833413] [2024-10-11 13:29:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:50,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495833413] [2024-10-11 13:29:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495833413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:29:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225290334] [2024-10-11 13:29:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:50,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:29:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:29:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:29:50,242 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:50,483 INFO L93 Difference]: Finished difference Result 239 states and 314 transitions. [2024-10-11 13:29:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:29:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-11 13:29:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:50,485 INFO L225 Difference]: With dead ends: 239 [2024-10-11 13:29:50,486 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 13:29:50,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:50,487 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 125 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:50,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 433 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 13:29:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 95. [2024-10-11 13:29:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-10-11 13:29:50,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 74 [2024-10-11 13:29:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-10-11 13:29:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-10-11 13:29:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:29:50,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:50,499 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:50,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:29:50,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:50,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1638787580, now seen corresponding path program 1 times [2024-10-11 13:29:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689532664] [2024-10-11 13:29:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:29:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689532664] [2024-10-11 13:29:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689532664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:50,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:29:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083690975] [2024-10-11 13:29:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:29:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:29:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:29:50,772 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:51,023 INFO L93 Difference]: Finished difference Result 228 states and 300 transitions. [2024-10-11 13:29:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:29:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-11 13:29:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:51,025 INFO L225 Difference]: With dead ends: 228 [2024-10-11 13:29:51,025 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 13:29:51,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:51,026 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 136 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:51,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 469 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 13:29:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2024-10-11 13:29:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:29:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-10-11 13:29:51,039 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 74 [2024-10-11 13:29:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:51,040 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-10-11 13:29:51,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:29:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-10-11 13:29:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 13:29:51,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:51,041 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:29:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:29:51,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 627670330, now seen corresponding path program 1 times [2024-10-11 13:29:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:51,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536012879] [2024-10-11 13:29:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:29:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:29:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 13:29:52,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536012879] [2024-10-11 13:29:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536012879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458202419] [2024-10-11 13:29:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:52,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:29:52,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:29:52,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:29:52,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:29:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 13:29:52,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:53,254 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-11 13:29:53,729 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-11 13:29:54,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:54,800 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 23 treesize of output 11 [2024-10-11 13:29:54,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:54,877 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 19 treesize of output 18 [2024-10-11 13:29:55,049 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 62 treesize of output 46 [2024-10-11 13:29:55,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:55,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2024-10-11 13:29:55,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:55,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:29:55,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2024-10-11 13:29:55,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 81 [2024-10-11 13:29:55,408 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 15 treesize of output 7 [2024-10-11 13:29:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 92 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 13:29:55,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:55,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse2 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse0) (< .cse1 0) (not (= v_ArrVal_241 (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< 127 .cse1)))) (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse3 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse0) (< (+ 128 .cse3) 0) (not (= v_ArrVal_241 (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse3))) (< 0 (+ .cse3 1))))))) is different from false [2024-10-11 13:29:55,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse0 (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (and (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse3) (< .cse1 0) (< 127 .cse1)))) (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse4 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))) (< (+ 128 .cse4) 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse3) (< 0 (+ .cse4 1)))))))) is different from false [2024-10-11 13:29:55,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse0 (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base))) (and (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_238 Int)) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< (+ 128 .cse1) 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_238)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (< 0 (+ .cse1 1))))) (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_238 Int)) (let ((.cse4 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))) (< .cse4 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_238)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (< 127 .cse4))))))) is different from false [2024-10-11 13:29:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458202419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:55,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:29:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-11 13:29:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781527838] [2024-10-11 13:29:55,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:29:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 13:29:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 13:29:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=732, Unknown=3, NotChecked=168, Total=992 [2024-10-11 13:29:55,869 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 13:30:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:00,341 INFO L93 Difference]: Finished difference Result 509 states and 641 transitions. [2024-10-11 13:30:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-11 13:30:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) Word has length 74 [2024-10-11 13:30:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:00,344 INFO L225 Difference]: With dead ends: 509 [2024-10-11 13:30:00,344 INFO L226 Difference]: Without dead ends: 415 [2024-10-11 13:30:00,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1122, Invalid=4739, Unknown=3, NotChecked=456, Total=6320 [2024-10-11 13:30:00,347 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2012 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 274 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:00,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 526 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1069 Invalid, 1 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:30:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-11 13:30:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 215. [2024-10-11 13:30:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 186 states have internal predecessors, (229), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 269 transitions. [2024-10-11 13:30:00,380 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 269 transitions. Word has length 74 [2024-10-11 13:30:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:00,380 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 269 transitions. [2024-10-11 13:30:00,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 13:30:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 269 transitions. [2024-10-11 13:30:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:30:00,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:00,382 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:00,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:30:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 13:30:00,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:00,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1540476555, now seen corresponding path program 1 times [2024-10-11 13:30:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726901154] [2024-10-11 13:30:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726901154] [2024-10-11 13:30:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726901154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 13:30:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429173119] [2024-10-11 13:30:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:30:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:02,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:30:02,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:30:02,134 INFO L87 Difference]: Start difference. First operand 215 states and 269 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 13:30:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:03,968 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2024-10-11 13:30:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 13:30:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2024-10-11 13:30:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:03,972 INFO L225 Difference]: With dead ends: 680 [2024-10-11 13:30:03,972 INFO L226 Difference]: Without dead ends: 478 [2024-10-11 13:30:03,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 13:30:03,973 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 964 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:03,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1127 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:30:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-11 13:30:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 231. [2024-10-11 13:30:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 201 states have (on average 1.2388059701492538) internal successors, (249), 202 states have internal predecessors, (249), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 289 transitions. [2024-10-11 13:30:04,010 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 289 transitions. Word has length 75 [2024-10-11 13:30:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:04,011 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 289 transitions. [2024-10-11 13:30:04,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 13:30:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 289 transitions. [2024-10-11 13:30:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:30:04,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:04,012 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:30:04,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 574790036, now seen corresponding path program 1 times [2024-10-11 13:30:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094861696] [2024-10-11 13:30:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094861696] [2024-10-11 13:30:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094861696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:04,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:30:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091475695] [2024-10-11 13:30:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:04,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:30:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:30:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:30:04,139 INFO L87 Difference]: Start difference. First operand 231 states and 289 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:04,207 INFO L93 Difference]: Finished difference Result 457 states and 572 transitions. [2024-10-11 13:30:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:30:04,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-11 13:30:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:04,209 INFO L225 Difference]: With dead ends: 457 [2024-10-11 13:30:04,209 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 13:30:04,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:30:04,210 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:04,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:30:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 13:30:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2024-10-11 13:30:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 204 states have internal predecessors, (251), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 291 transitions. [2024-10-11 13:30:04,244 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 291 transitions. Word has length 75 [2024-10-11 13:30:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:04,244 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 291 transitions. [2024-10-11 13:30:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 291 transitions. [2024-10-11 13:30:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:30:04,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:04,246 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:04,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:30:04,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:04,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2021205531, now seen corresponding path program 1 times [2024-10-11 13:30:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:04,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774707322] [2024-10-11 13:30:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774707322] [2024-10-11 13:30:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774707322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:04,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58457205] [2024-10-11 13:30:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:04,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:04,381 INFO L87 Difference]: Start difference. First operand 233 states and 291 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:04,503 INFO L93 Difference]: Finished difference Result 453 states and 566 transitions. [2024-10-11 13:30:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-11 13:30:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:04,505 INFO L225 Difference]: With dead ends: 453 [2024-10-11 13:30:04,505 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 13:30:04,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:30:04,507 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:04,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 13:30:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-11 13:30:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.2266009852216748) internal successors, (249), 204 states have internal predecessors, (249), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 289 transitions. [2024-10-11 13:30:04,540 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 289 transitions. Word has length 75 [2024-10-11 13:30:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:04,540 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 289 transitions. [2024-10-11 13:30:04,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 289 transitions. [2024-10-11 13:30:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 13:30:04,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:04,541 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:04,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:30:04,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:04,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -527455935, now seen corresponding path program 1 times [2024-10-11 13:30:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563646688] [2024-10-11 13:30:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:05,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563646688] [2024-10-11 13:30:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563646688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:30:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800974502] [2024-10-11 13:30:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:30:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:30:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:30:05,174 INFO L87 Difference]: Start difference. First operand 233 states and 289 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:05,769 INFO L93 Difference]: Finished difference Result 539 states and 667 transitions. [2024-10-11 13:30:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:30:05,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-10-11 13:30:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:05,771 INFO L225 Difference]: With dead ends: 539 [2024-10-11 13:30:05,771 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 13:30:05,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:30:05,772 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 111 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:05,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 850 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:30:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 13:30:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2024-10-11 13:30:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.223463687150838) internal successors, (219), 180 states have internal predecessors, (219), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2024-10-11 13:30:05,806 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 76 [2024-10-11 13:30:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:05,806 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2024-10-11 13:30:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2024-10-11 13:30:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:30:05,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:05,807 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:30:05,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 76875821, now seen corresponding path program 1 times [2024-10-11 13:30:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857599418] [2024-10-11 13:30:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857599418] [2024-10-11 13:30:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857599418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:05,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776557314] [2024-10-11 13:30:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:05,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:05,935 INFO L87 Difference]: Start difference. First operand 209 states and 259 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:06,018 INFO L93 Difference]: Finished difference Result 473 states and 587 transitions. [2024-10-11 13:30:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:06,018 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-10-11 13:30:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:06,020 INFO L225 Difference]: With dead ends: 473 [2024-10-11 13:30:06,021 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 13:30:06,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:30:06,022 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:06,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:30:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 13:30:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 209. [2024-10-11 13:30:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.2122905027932962) internal successors, (217), 180 states have internal predecessors, (217), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2024-10-11 13:30:06,057 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 77 [2024-10-11 13:30:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:06,057 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2024-10-11 13:30:06,058 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2024-10-11 13:30:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:30:06,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:06,059 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:30:06,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2122187141, now seen corresponding path program 1 times [2024-10-11 13:30:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026769677] [2024-10-11 13:30:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026769677] [2024-10-11 13:30:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026769677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484282188] [2024-10-11 13:30:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:06,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:06,191 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:06,278 INFO L93 Difference]: Finished difference Result 465 states and 575 transitions. [2024-10-11 13:30:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-11 13:30:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:06,280 INFO L225 Difference]: With dead ends: 465 [2024-10-11 13:30:06,280 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 13:30:06,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:30:06,281 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:06,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:30:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 13:30:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 219. [2024-10-11 13:30:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 190 states have internal predecessors, (227), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 267 transitions. [2024-10-11 13:30:06,318 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 267 transitions. Word has length 78 [2024-10-11 13:30:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:06,319 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 267 transitions. [2024-10-11 13:30:06,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 267 transitions. [2024-10-11 13:30:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:30:06,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:06,321 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:06,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:30:06,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1674557519, now seen corresponding path program 1 times [2024-10-11 13:30:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487543743] [2024-10-11 13:30:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487543743] [2024-10-11 13:30:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487543743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:30:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282143792] [2024-10-11 13:30:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:30:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:30:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:30:06,682 INFO L87 Difference]: Start difference. First operand 219 states and 267 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:30:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:07,026 INFO L93 Difference]: Finished difference Result 526 states and 631 transitions. [2024-10-11 13:30:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:30:07,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-10-11 13:30:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:07,028 INFO L225 Difference]: With dead ends: 526 [2024-10-11 13:30:07,028 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 13:30:07,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:30:07,029 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 228 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:07,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 536 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:30:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 13:30:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 201. [2024-10-11 13:30:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.1597633136094674) internal successors, (196), 171 states have internal predecessors, (196), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2024-10-11 13:30:07,081 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 78 [2024-10-11 13:30:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2024-10-11 13:30:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:30:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2024-10-11 13:30:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:30:07,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:07,084 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:30:07,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1455702801, now seen corresponding path program 1 times [2024-10-11 13:30:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747290768] [2024-10-11 13:30:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:07,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747290768] [2024-10-11 13:30:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747290768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:07,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683293784] [2024-10-11 13:30:07,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:07,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:07,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:07,175 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:07,306 INFO L93 Difference]: Finished difference Result 423 states and 498 transitions. [2024-10-11 13:30:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:07,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-11 13:30:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:07,308 INFO L225 Difference]: With dead ends: 423 [2024-10-11 13:30:07,308 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 13:30:07,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:30:07,310 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:07,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 388 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 13:30:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 216. [2024-10-11 13:30:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.1521739130434783) internal successors, (212), 186 states have internal predecessors, (212), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2024-10-11 13:30:07,353 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 78 [2024-10-11 13:30:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2024-10-11 13:30:07,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2024-10-11 13:30:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:30:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:07,354 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:30:07,355 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1177574646, now seen corresponding path program 1 times [2024-10-11 13:30:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417804438] [2024-10-11 13:30:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417804438] [2024-10-11 13:30:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417804438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:30:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075044614] [2024-10-11 13:30:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:30:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:30:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:30:08,030 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:08,253 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-10-11 13:30:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:30:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-11 13:30:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:08,256 INFO L225 Difference]: With dead ends: 222 [2024-10-11 13:30:08,256 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:30:08,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:30:08,257 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 136 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:08,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 267 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:30:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-11 13:30:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.148936170212766) internal successors, (216), 190 states have internal predecessors, (216), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2024-10-11 13:30:08,305 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 80 [2024-10-11 13:30:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2024-10-11 13:30:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2024-10-11 13:30:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:30:08,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:08,307 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:30:08,307 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1177515064, now seen corresponding path program 1 times [2024-10-11 13:30:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722473225] [2024-10-11 13:30:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722473225] [2024-10-11 13:30:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722473225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:30:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741078899] [2024-10-11 13:30:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:30:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:30:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:30:08,528 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:08,685 INFO L93 Difference]: Finished difference Result 415 states and 484 transitions. [2024-10-11 13:30:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:30:08,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-11 13:30:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:08,687 INFO L225 Difference]: With dead ends: 415 [2024-10-11 13:30:08,687 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:30:08,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:30:08,688 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 102 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:08,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 271 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:30:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-11 13:30:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.1382978723404256) internal successors, (214), 190 states have internal predecessors, (214), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2024-10-11 13:30:08,741 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 80 [2024-10-11 13:30:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2024-10-11 13:30:08,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2024-10-11 13:30:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 13:30:08,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:08,743 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:08,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:30:08,743 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1120256762, now seen corresponding path program 1 times [2024-10-11 13:30:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850690449] [2024-10-11 13:30:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850690449] [2024-10-11 13:30:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850690449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:09,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:30:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903411743] [2024-10-11 13:30:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:30:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:30:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:30:09,853 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:30:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:10,429 INFO L93 Difference]: Finished difference Result 556 states and 644 transitions. [2024-10-11 13:30:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:30:10,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-11 13:30:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:10,432 INFO L225 Difference]: With dead ends: 556 [2024-10-11 13:30:10,432 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 13:30:10,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:30:10,433 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 581 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:10,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 423 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:30:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 13:30:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 321. [2024-10-11 13:30:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 289 states have (on average 1.1418685121107266) internal successors, (330), 291 states have internal predecessors, (330), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 370 transitions. [2024-10-11 13:30:10,487 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 370 transitions. Word has length 80 [2024-10-11 13:30:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 370 transitions. [2024-10-11 13:30:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:30:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 370 transitions. [2024-10-11 13:30:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 13:30:10,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:10,489 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:30:10,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 318973285, now seen corresponding path program 1 times [2024-10-11 13:30:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129579509] [2024-10-11 13:30:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129579509] [2024-10-11 13:30:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129579509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:10,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:10,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696180480] [2024-10-11 13:30:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:10,616 INFO L87 Difference]: Start difference. First operand 321 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:10,739 INFO L93 Difference]: Finished difference Result 665 states and 767 transitions. [2024-10-11 13:30:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-10-11 13:30:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:10,741 INFO L225 Difference]: With dead ends: 665 [2024-10-11 13:30:10,741 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 13:30:10,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-11 13:30:10,742 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:10,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 382 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:30:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 13:30:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 279. [2024-10-11 13:30:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 247 states have (on average 1.125506072874494) internal successors, (278), 249 states have internal predecessors, (278), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2024-10-11 13:30:10,792 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 81 [2024-10-11 13:30:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:10,793 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2024-10-11 13:30:10,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2024-10-11 13:30:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 13:30:10,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:10,794 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:30:10,795 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:10,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -283922431, now seen corresponding path program 1 times [2024-10-11 13:30:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074430889] [2024-10-11 13:30:10,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074430889] [2024-10-11 13:30:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074430889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:11,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:11,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:30:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181626839] [2024-10-11 13:30:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:11,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:30:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:30:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:30:11,157 INFO L87 Difference]: Start difference. First operand 279 states and 318 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:11,353 INFO L93 Difference]: Finished difference Result 626 states and 711 transitions. [2024-10-11 13:30:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:30:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-11 13:30:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:11,356 INFO L225 Difference]: With dead ends: 626 [2024-10-11 13:30:11,356 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 13:30:11,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:30:11,357 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 127 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:11,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 227 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 13:30:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 354. [2024-10-11 13:30:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 322 states have (on average 1.1211180124223603) internal successors, (361), 324 states have internal predecessors, (361), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 401 transitions. [2024-10-11 13:30:11,399 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 401 transitions. Word has length 82 [2024-10-11 13:30:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:11,399 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 401 transitions. [2024-10-11 13:30:11,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 401 transitions. [2024-10-11 13:30:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 13:30:11,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:11,401 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:30:11,401 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1678882448, now seen corresponding path program 1 times [2024-10-11 13:30:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131314133] [2024-10-11 13:30:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131314133] [2024-10-11 13:30:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131314133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:30:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976781694] [2024-10-11 13:30:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:11,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:30:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:30:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:30:11,510 INFO L87 Difference]: Start difference. First operand 354 states and 401 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:11,624 INFO L93 Difference]: Finished difference Result 607 states and 687 transitions. [2024-10-11 13:30:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:30:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-11 13:30:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:11,627 INFO L225 Difference]: With dead ends: 607 [2024-10-11 13:30:11,627 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 13:30:11,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-11 13:30:11,628 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:11,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 13:30:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-11 13:30:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 248 states have internal predecessors, (273), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2024-10-11 13:30:11,687 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 82 [2024-10-11 13:30:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:11,687 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2024-10-11 13:30:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2024-10-11 13:30:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 13:30:11,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:11,689 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:11,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 13:30:11,689 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1495393611, now seen corresponding path program 1 times [2024-10-11 13:30:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688644731] [2024-10-11 13:30:11,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688644731] [2024-10-11 13:30:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688644731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:12,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:30:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872692854] [2024-10-11 13:30:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:12,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:30:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:30:12,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:30:12,966 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 13:30:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:13,682 INFO L93 Difference]: Finished difference Result 541 states and 609 transitions. [2024-10-11 13:30:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:30:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2024-10-11 13:30:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:13,685 INFO L225 Difference]: With dead ends: 541 [2024-10-11 13:30:13,685 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 13:30:13,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:30:13,686 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 411 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:13,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 404 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:30:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 13:30:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2024-10-11 13:30:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 248 states have (on average 1.1088709677419355) internal successors, (275), 250 states have internal predecessors, (275), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:30:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 315 transitions. [2024-10-11 13:30:13,743 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 315 transitions. Word has length 83 [2024-10-11 13:30:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:13,743 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 315 transitions. [2024-10-11 13:30:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 13:30:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 315 transitions. [2024-10-11 13:30:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:30:13,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:13,744 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:30:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:30:13,745 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:13,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1981685327, now seen corresponding path program 1 times [2024-10-11 13:30:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:30:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699733898] [2024-10-11 13:30:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:30:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:30:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:30:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:30:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:30:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:30:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:30:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:30:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:30:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:30:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:30:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699733898] [2024-10-11 13:30:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699733898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:30:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:30:13,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:30:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858255644] [2024-10-11 13:30:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:30:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:13,867 INFO L87 Difference]: Start difference. First operand 280 states and 315 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:13,966 INFO L93 Difference]: Finished difference Result 513 states and 575 transitions. [2024-10-11 13:30:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-10-11 13:30:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:13,967 INFO L225 Difference]: With dead ends: 513 [2024-10-11 13:30:13,967 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 13:30:13,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:30:13,968 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:13,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:30:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 13:30:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 13:30:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 13:30:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 13:30:13,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-11 13:30:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 13:30:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 13:30:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 13:30:13,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 13:30:13,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:30:13,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:30:13,976 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 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-11 13:30:13,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.