./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2dab74649212a3ffb00bb2114fde15cc6c5343aaff8c111997aa1541045c9bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:39:58,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:39:58,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:39:58,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:39:58,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:39:58,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:39:58,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:39:58,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:39:58,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:39:58,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:39:58,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:39:58,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:39:58,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:39:58,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:39:58,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:39:58,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:39:58,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:39:58,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:39:58,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:39:58,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:39:58,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:39:58,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:39:58,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:39:58,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:39:58,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:39:58,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:39:58,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:39:58,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:39:58,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:39:58,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:39:58,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:39:58,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:39:58,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:39:58,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:39:58,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:39:58,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:39:58,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:39:58,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:39:58,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:39:58,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:39:58,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:39:58,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:39:58,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2dab74649212a3ffb00bb2114fde15cc6c5343aaff8c111997aa1541045c9bd [2024-11-19 00:39:58,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:39:59,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:39:59,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:39:59,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:39:59,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:39:59,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i [2024-11-19 00:40:00,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:40:00,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:40:00,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i [2024-11-19 00:40:00,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f67f5b2/a6636c7a38d84fdf912efa4aaa3e6be0/FLAG862bf7f7b [2024-11-19 00:40:00,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f67f5b2/a6636c7a38d84fdf912efa4aaa3e6be0 [2024-11-19 00:40:00,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:40:00,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:40:00,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:40:00,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:40:00,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:40:00,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:40:00" (1/1) ... [2024-11-19 00:40:00,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ba8b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:00, skipping insertion in model container [2024-11-19 00:40:00,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:40:00" (1/1) ... [2024-11-19 00:40:00,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:40:01,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i[916,929] [2024-11-19 00:40:01,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:40:01,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:40:01,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i[916,929] [2024-11-19 00:40:01,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:40:01,196 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:40:01,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01 WrapperNode [2024-11-19 00:40:01,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:40:01,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:40:01,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:40:01,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:40:01,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,270 INFO L138 Inliner]: procedures = 27, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2024-11-19 00:40:01,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:40:01,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:40:01,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:40:01,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:40:01,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,320 INFO L175 MemorySlicer]: Split 140 memory accesses to 6 slices as follows [2, 70, 25, 7, 29, 7]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 3, 1, 2, 1]. The 33 writes are split as follows [0, 23, 4, 3, 2, 1]. [2024-11-19 00:40:01,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:40:01,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:40:01,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:40:01,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:40:01,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (1/1) ... [2024-11-19 00:40:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:40:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:01,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:40:01,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:40:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:40:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 00:40:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 00:40:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-19 00:40:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:40:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:40:01,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:40:01,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:40:01,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:40:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:40:01,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:40:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:40:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:40:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:40:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:40:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:40:01,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:40:01,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:40:02,183 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-19 00:40:02,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:40:02,201 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:40:02,201 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:40:02,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:40:02 BoogieIcfgContainer [2024-11-19 00:40:02,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:40:02,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:40:02,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:40:02,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:40:02,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:40:00" (1/3) ... [2024-11-19 00:40:02,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3337d8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:40:02, skipping insertion in model container [2024-11-19 00:40:02,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:01" (2/3) ... [2024-11-19 00:40:02,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3337d8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:40:02, skipping insertion in model container [2024-11-19 00:40:02,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:40:02" (3/3) ... [2024-11-19 00:40:02,213 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-85.i [2024-11-19 00:40:02,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:40:02,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:40:02,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:40:02,291 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;@1e23de4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:40:02,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:40:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:40:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 00:40:02,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:02,309 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:02,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -632733008, now seen corresponding path program 1 times [2024-11-19 00:40:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583965044] [2024-11-19 00:40:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-19 00:40:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583965044] [2024-11-19 00:40:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583965044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030127461] [2024-11-19 00:40:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:02,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:02,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:02,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:40:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:02,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:40:02,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-19 00:40:03,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030127461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:40:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859576575] [2024-11-19 00:40:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:03,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:40:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:40:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:40:03,046 INFO L87 Difference]: Start difference. First operand has 131 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:03,075 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-19 00:40:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:40:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2024-11-19 00:40:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:03,083 INFO L225 Difference]: With dead ends: 255 [2024-11-19 00:40:03,083 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 00:40:03,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:40:03,089 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:03,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 00:40:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 00:40:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:40:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2024-11-19 00:40:03,130 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2024-11-19 00:40:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:03,131 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2024-11-19 00:40:03,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2024-11-19 00:40:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 00:40:03,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:03,135 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:03,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:40:03,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:40:03,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash -493224382, now seen corresponding path program 1 times [2024-11-19 00:40:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705843099] [2024-11-19 00:40:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705843099] [2024-11-19 00:40:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705843099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:40:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836475810] [2024-11-19 00:40:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:05,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:40:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:05,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:40:05,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:05,988 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:06,580 INFO L93 Difference]: Finished difference Result 470 states and 679 transitions. [2024-11-19 00:40:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:40:06,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2024-11-19 00:40:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:06,588 INFO L225 Difference]: With dead ends: 470 [2024-11-19 00:40:06,588 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 00:40:06,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:06,593 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 524 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:06,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 612 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:40:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 00:40:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 199. [2024-11-19 00:40:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.391812865497076) internal successors, (238), 172 states have internal predecessors, (238), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 288 transitions. [2024-11-19 00:40:06,634 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 288 transitions. Word has length 179 [2024-11-19 00:40:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 288 transitions. [2024-11-19 00:40:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 288 transitions. [2024-11-19 00:40:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:06,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:06,641 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:06,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:40:06,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:06,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1535301185, now seen corresponding path program 1 times [2024-11-19 00:40:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584991283] [2024-11-19 00:40:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584991283] [2024-11-19 00:40:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584991283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:07,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:07,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805385464] [2024-11-19 00:40:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:07,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:07,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:07,017 INFO L87 Difference]: Start difference. First operand 199 states and 288 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:07,306 INFO L93 Difference]: Finished difference Result 575 states and 834 transitions. [2024-11-19 00:40:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:07,311 INFO L225 Difference]: With dead ends: 575 [2024-11-19 00:40:07,311 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 00:40:07,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:07,313 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 160 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:07,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 508 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 00:40:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 203. [2024-11-19 00:40:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3828571428571428) internal successors, (242), 176 states have internal predecessors, (242), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2024-11-19 00:40:07,341 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 180 [2024-11-19 00:40:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:07,343 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2024-11-19 00:40:07,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2024-11-19 00:40:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:07,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:07,349 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:40:07,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1213410666, now seen corresponding path program 1 times [2024-11-19 00:40:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888926981] [2024-11-19 00:40:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888926981] [2024-11-19 00:40:07,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888926981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:07,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:07,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:40:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869885735] [2024-11-19 00:40:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:40:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:40:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:07,920 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:08,383 INFO L93 Difference]: Finished difference Result 782 states and 1124 transitions. [2024-11-19 00:40:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:08,390 INFO L225 Difference]: With dead ends: 782 [2024-11-19 00:40:08,390 INFO L226 Difference]: Without dead ends: 582 [2024-11-19 00:40:08,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:08,392 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 414 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:08,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 995 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-19 00:40:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 249. [2024-11-19 00:40:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 221 states have (on average 1.3936651583710407) internal successors, (308), 222 states have internal predecessors, (308), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 358 transitions. [2024-11-19 00:40:08,426 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 358 transitions. Word has length 180 [2024-11-19 00:40:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 358 transitions. [2024-11-19 00:40:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 358 transitions. [2024-11-19 00:40:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:08,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:08,430 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:40:08,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:08,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2060488276, now seen corresponding path program 1 times [2024-11-19 00:40:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415559853] [2024-11-19 00:40:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415559853] [2024-11-19 00:40:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415559853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662094915] [2024-11-19 00:40:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:09,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:09,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:09,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:40:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:09,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:40:09,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:09,651 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 11 treesize of output 9 [2024-11-19 00:40:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:09,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662094915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-19 00:40:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654978383] [2024-11-19 00:40:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:40:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:40:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:40:09,747 INFO L87 Difference]: Start difference. First operand 249 states and 358 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:09,901 INFO L93 Difference]: Finished difference Result 737 states and 1062 transitions. [2024-11-19 00:40:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:09,905 INFO L225 Difference]: With dead ends: 737 [2024-11-19 00:40:09,905 INFO L226 Difference]: Without dead ends: 491 [2024-11-19 00:40:09,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:40:09,907 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 177 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:09,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1843 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-19 00:40:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 263. [2024-11-19 00:40:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 235 states have (on average 1.3787234042553191) internal successors, (324), 236 states have internal predecessors, (324), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 374 transitions. [2024-11-19 00:40:09,931 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 374 transitions. Word has length 180 [2024-11-19 00:40:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:09,931 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 374 transitions. [2024-11-19 00:40:09,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 374 transitions. [2024-11-19 00:40:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:09,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:09,934 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:09,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:40:10,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:10,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:10,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -395762216, now seen corresponding path program 1 times [2024-11-19 00:40:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519408469] [2024-11-19 00:40:10,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519408469] [2024-11-19 00:40:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519408469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764532548] [2024-11-19 00:40:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:11,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:40:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:11,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 00:40:11,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:11,321 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 13 treesize of output 9 [2024-11-19 00:40:11,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-19 00:40:11,425 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 23 treesize of output 15 [2024-11-19 00:40:11,453 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 23 treesize of output 11 [2024-11-19 00:40:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:11,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764532548] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:40:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 12] total 20 [2024-11-19 00:40:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298624458] [2024-11-19 00:40:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:40:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:40:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:40:11,680 INFO L87 Difference]: Start difference. First operand 263 states and 374 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:12,116 INFO L93 Difference]: Finished difference Result 677 states and 964 transitions. [2024-11-19 00:40:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:40:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:12,120 INFO L225 Difference]: With dead ends: 677 [2024-11-19 00:40:12,120 INFO L226 Difference]: Without dead ends: 417 [2024-11-19 00:40:12,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:40:12,122 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 144 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:12,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1515 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-19 00:40:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 265. [2024-11-19 00:40:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.3839662447257384) internal successors, (328), 238 states have internal predecessors, (328), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 378 transitions. [2024-11-19 00:40:12,138 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 378 transitions. Word has length 180 [2024-11-19 00:40:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 378 transitions. [2024-11-19 00:40:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 378 transitions. [2024-11-19 00:40:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:12,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:12,141 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:12,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:12,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:12,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:12,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1416830570, now seen corresponding path program 1 times [2024-11-19 00:40:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502875865] [2024-11-19 00:40:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:12,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502875865] [2024-11-19 00:40:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502875865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:40:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995548866] [2024-11-19 00:40:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:40:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:40:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:12,764 INFO L87 Difference]: Start difference. First operand 265 states and 378 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:13,247 INFO L93 Difference]: Finished difference Result 868 states and 1236 transitions. [2024-11-19 00:40:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:13,250 INFO L225 Difference]: With dead ends: 868 [2024-11-19 00:40:13,250 INFO L226 Difference]: Without dead ends: 606 [2024-11-19 00:40:13,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:13,252 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 321 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:13,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1584 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-19 00:40:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 273. [2024-11-19 00:40:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 245 states have (on average 1.3714285714285714) internal successors, (336), 246 states have internal predecessors, (336), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 386 transitions. [2024-11-19 00:40:13,271 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 386 transitions. Word has length 180 [2024-11-19 00:40:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:13,272 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 386 transitions. [2024-11-19 00:40:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 386 transitions. [2024-11-19 00:40:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:13,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:13,274 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:13,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:40:13,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 576235292, now seen corresponding path program 1 times [2024-11-19 00:40:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907121732] [2024-11-19 00:40:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907121732] [2024-11-19 00:40:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907121732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:13,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814559158] [2024-11-19 00:40:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:13,722 INFO L87 Difference]: Start difference. First operand 273 states and 386 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:13,876 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2024-11-19 00:40:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:13,880 INFO L225 Difference]: With dead ends: 705 [2024-11-19 00:40:13,880 INFO L226 Difference]: Without dead ends: 435 [2024-11-19 00:40:13,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-19 00:40:13,881 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 147 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1196 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-11-19 00:40:13,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1196 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-19 00:40:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 281. [2024-11-19 00:40:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 253 states have (on average 1.3754940711462451) internal successors, (348), 254 states have internal predecessors, (348), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 398 transitions. [2024-11-19 00:40:13,903 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 398 transitions. Word has length 180 [2024-11-19 00:40:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:13,905 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 398 transitions. [2024-11-19 00:40:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 398 transitions. [2024-11-19 00:40:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:13,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:13,908 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:40:13,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -444833062, now seen corresponding path program 1 times [2024-11-19 00:40:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975021608] [2024-11-19 00:40:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:14,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975021608] [2024-11-19 00:40:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975021608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963837902] [2024-11-19 00:40:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:14,334 INFO L87 Difference]: Start difference. First operand 281 states and 398 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:14,650 INFO L93 Difference]: Finished difference Result 837 states and 1184 transitions. [2024-11-19 00:40:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:14,654 INFO L225 Difference]: With dead ends: 837 [2024-11-19 00:40:14,654 INFO L226 Difference]: Without dead ends: 559 [2024-11-19 00:40:14,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:14,655 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 157 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:14,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 912 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-19 00:40:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 341. [2024-11-19 00:40:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 313 states have (on average 1.3993610223642172) internal successors, (438), 314 states have internal predecessors, (438), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 488 transitions. [2024-11-19 00:40:14,673 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 488 transitions. Word has length 180 [2024-11-19 00:40:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 488 transitions. [2024-11-19 00:40:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 488 transitions. [2024-11-19 00:40:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:14,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:14,677 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:40:14,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash 898125811, now seen corresponding path program 1 times [2024-11-19 00:40:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009077621] [2024-11-19 00:40:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009077621] [2024-11-19 00:40:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009077621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738611599] [2024-11-19 00:40:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:14,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:14,892 INFO L87 Difference]: Start difference. First operand 341 states and 488 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:15,182 INFO L93 Difference]: Finished difference Result 927 states and 1336 transitions. [2024-11-19 00:40:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:15,186 INFO L225 Difference]: With dead ends: 927 [2024-11-19 00:40:15,186 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 00:40:15,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:15,188 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 158 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:15,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 837 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 00:40:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 339. [2024-11-19 00:40:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 312 states have internal predecessors, (428), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 478 transitions. [2024-11-19 00:40:15,206 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 478 transitions. Word has length 180 [2024-11-19 00:40:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:15,206 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 478 transitions. [2024-11-19 00:40:15,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 478 transitions. [2024-11-19 00:40:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:40:15,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:15,208 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:40:15,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 256766812, now seen corresponding path program 1 times [2024-11-19 00:40:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:15,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646178158] [2024-11-19 00:40:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646178158] [2024-11-19 00:40:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646178158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121597785] [2024-11-19 00:40:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:15,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:15,313 INFO L87 Difference]: Start difference. First operand 339 states and 478 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:15,340 INFO L93 Difference]: Finished difference Result 641 states and 902 transitions. [2024-11-19 00:40:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-19 00:40:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:15,342 INFO L225 Difference]: With dead ends: 641 [2024-11-19 00:40:15,342 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 00:40:15,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:15,344 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:15,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 00:40:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-19 00:40:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 425 transitions. [2024-11-19 00:40:15,357 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 425 transitions. Word has length 180 [2024-11-19 00:40:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:15,357 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 425 transitions. [2024-11-19 00:40:15,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 425 transitions. [2024-11-19 00:40:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:40:15,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:15,359 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:15,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:40:15,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:15,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1900634344, now seen corresponding path program 1 times [2024-11-19 00:40:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:15,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895063471] [2024-11-19 00:40:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895063471] [2024-11-19 00:40:15,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895063471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:15,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:15,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515363686] [2024-11-19 00:40:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:15,515 INFO L87 Difference]: Start difference. First operand 305 states and 425 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:15,544 INFO L93 Difference]: Finished difference Result 613 states and 855 transitions. [2024-11-19 00:40:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2024-11-19 00:40:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:15,547 INFO L225 Difference]: With dead ends: 613 [2024-11-19 00:40:15,547 INFO L226 Difference]: Without dead ends: 311 [2024-11-19 00:40:15,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-19 00:40:15,548 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:15,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 707 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-19 00:40:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-19 00:40:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 283 states have (on average 1.3462897526501767) internal successors, (381), 284 states have internal predecessors, (381), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 431 transitions. [2024-11-19 00:40:15,564 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 431 transitions. Word has length 181 [2024-11-19 00:40:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 431 transitions. [2024-11-19 00:40:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 431 transitions. [2024-11-19 00:40:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:40:15,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:15,567 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:40:15,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:15,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1973020902, now seen corresponding path program 1 times [2024-11-19 00:40:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783498945] [2024-11-19 00:40:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783498945] [2024-11-19 00:40:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783498945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958406349] [2024-11-19 00:40:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:16,120 INFO L87 Difference]: Start difference. First operand 311 states and 431 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:16,571 INFO L93 Difference]: Finished difference Result 789 states and 1094 transitions. [2024-11-19 00:40:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2024-11-19 00:40:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:16,574 INFO L225 Difference]: With dead ends: 789 [2024-11-19 00:40:16,575 INFO L226 Difference]: Without dead ends: 481 [2024-11-19 00:40:16,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:16,576 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 309 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:16,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 758 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-19 00:40:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 308. [2024-11-19 00:40:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 280 states have (on average 1.3464285714285715) internal successors, (377), 281 states have internal predecessors, (377), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 427 transitions. [2024-11-19 00:40:16,594 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 427 transitions. Word has length 181 [2024-11-19 00:40:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:16,594 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 427 transitions. [2024-11-19 00:40:16,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 427 transitions. [2024-11-19 00:40:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:40:16,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:16,597 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:40:16,597 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:16,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1654071006, now seen corresponding path program 1 times [2024-11-19 00:40:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641310800] [2024-11-19 00:40:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641310800] [2024-11-19 00:40:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641310800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372500495] [2024-11-19 00:40:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:17,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:17,212 INFO L87 Difference]: Start difference. First operand 308 states and 427 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:17,576 INFO L93 Difference]: Finished difference Result 737 states and 1023 transitions. [2024-11-19 00:40:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2024-11-19 00:40:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:17,579 INFO L225 Difference]: With dead ends: 737 [2024-11-19 00:40:17,579 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 00:40:17,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:17,580 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 306 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:17,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 489 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 00:40:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 308. [2024-11-19 00:40:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 281 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 426 transitions. [2024-11-19 00:40:17,595 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 426 transitions. Word has length 181 [2024-11-19 00:40:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:17,596 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 426 transitions. [2024-11-19 00:40:17,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 426 transitions. [2024-11-19 00:40:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:40:17,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:17,598 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:40:17,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 633002652, now seen corresponding path program 1 times [2024-11-19 00:40:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754225325] [2024-11-19 00:40:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:18,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754225325] [2024-11-19 00:40:18,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754225325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646848575] [2024-11-19 00:40:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:18,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:18,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:18,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:40:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:18,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 00:40:18,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:18,728 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 13 treesize of output 9 [2024-11-19 00:40:18,767 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 11 treesize of output 7 [2024-11-19 00:40:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:18,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646848575] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:18,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:40:18,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 10] total 17 [2024-11-19 00:40:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549567203] [2024-11-19 00:40:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:18,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:40:18,982 INFO L87 Difference]: Start difference. First operand 308 states and 426 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:19,146 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2024-11-19 00:40:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2024-11-19 00:40:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:19,149 INFO L225 Difference]: With dead ends: 711 [2024-11-19 00:40:19,149 INFO L226 Difference]: Without dead ends: 406 [2024-11-19 00:40:19,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:40:19,151 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 138 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:19,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1371 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-19 00:40:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 307. [2024-11-19 00:40:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3440860215053763) internal successors, (375), 280 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 425 transitions. [2024-11-19 00:40:19,169 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 425 transitions. Word has length 181 [2024-11-19 00:40:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:19,169 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 425 transitions. [2024-11-19 00:40:19,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2024-11-19 00:40:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:40:19,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:19,171 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:19,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:40:19,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 00:40:19,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:19,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2112639665, now seen corresponding path program 1 times [2024-11-19 00:40:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746933587] [2024-11-19 00:40:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746933587] [2024-11-19 00:40:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746933587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:19,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:40:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78856524] [2024-11-19 00:40:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:19,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:40:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:40:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:40:19,478 INFO L87 Difference]: Start difference. First operand 307 states and 425 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:19,500 INFO L93 Difference]: Finished difference Result 612 states and 849 transitions. [2024-11-19 00:40:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:40:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-19 00:40:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:19,503 INFO L225 Difference]: With dead ends: 612 [2024-11-19 00:40:19,503 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 00:40:19,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:40:19,504 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:19,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 00:40:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-19 00:40:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 281 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 00:40:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 426 transitions. [2024-11-19 00:40:19,520 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 426 transitions. Word has length 182 [2024-11-19 00:40:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:19,521 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 426 transitions. [2024-11-19 00:40:19,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 426 transitions. [2024-11-19 00:40:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:40:19,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:19,523 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:40:19,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1083280367, now seen corresponding path program 1 times [2024-11-19 00:40:19,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:19,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487481739] [2024-11-19 00:40:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487481739] [2024-11-19 00:40:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487481739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866117520] [2024-11-19 00:40:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:19,805 INFO L87 Difference]: Start difference. First operand 308 states and 426 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:20,036 INFO L93 Difference]: Finished difference Result 826 states and 1140 transitions. [2024-11-19 00:40:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 182 [2024-11-19 00:40:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:20,040 INFO L225 Difference]: With dead ends: 826 [2024-11-19 00:40:20,040 INFO L226 Difference]: Without dead ends: 521 [2024-11-19 00:40:20,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:20,041 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 160 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:20,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1139 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-19 00:40:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2024-11-19 00:40:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 468 states have (on average 1.3333333333333333) internal successors, (624), 471 states have internal predecessors, (624), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 714 transitions. [2024-11-19 00:40:20,067 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 714 transitions. Word has length 182 [2024-11-19 00:40:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:20,068 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 714 transitions. [2024-11-19 00:40:20,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 714 transitions. [2024-11-19 00:40:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:40:20,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:20,070 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:40:20,071 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:20,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash 688913581, now seen corresponding path program 1 times [2024-11-19 00:40:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067551245] [2024-11-19 00:40:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067551245] [2024-11-19 00:40:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067551245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:20,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913494719] [2024-11-19 00:40:20,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:20,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:20,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:20,346 INFO L87 Difference]: Start difference. First operand 518 states and 714 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:20,427 INFO L93 Difference]: Finished difference Result 955 states and 1315 transitions. [2024-11-19 00:40:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:20,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 182 [2024-11-19 00:40:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:20,429 INFO L225 Difference]: With dead ends: 955 [2024-11-19 00:40:20,430 INFO L226 Difference]: Without dead ends: 440 [2024-11-19 00:40:20,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-19 00:40:20,431 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:20,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 656 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-19 00:40:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-19 00:40:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 390 states have (on average 1.3153846153846154) internal successors, (513), 393 states have internal predecessors, (513), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 603 transitions. [2024-11-19 00:40:20,458 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 603 transitions. Word has length 182 [2024-11-19 00:40:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:20,459 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 603 transitions. [2024-11-19 00:40:20,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 603 transitions. [2024-11-19 00:40:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-19 00:40:20,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:20,461 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:40:20,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -621272487, now seen corresponding path program 1 times [2024-11-19 00:40:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629383600] [2024-11-19 00:40:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629383600] [2024-11-19 00:40:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629383600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:40:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824275122] [2024-11-19 00:40:20,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:40:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:40:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:20,918 INFO L87 Difference]: Start difference. First operand 440 states and 603 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:21,098 INFO L93 Difference]: Finished difference Result 947 states and 1300 transitions. [2024-11-19 00:40:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2024-11-19 00:40:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:21,102 INFO L225 Difference]: With dead ends: 947 [2024-11-19 00:40:21,102 INFO L226 Difference]: Without dead ends: 510 [2024-11-19 00:40:21,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:40:21,103 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 163 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:21,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1460 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-19 00:40:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 452. [2024-11-19 00:40:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 402 states have (on average 1.3059701492537314) internal successors, (525), 405 states have internal predecessors, (525), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 615 transitions. [2024-11-19 00:40:21,136 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 615 transitions. Word has length 183 [2024-11-19 00:40:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 615 transitions. [2024-11-19 00:40:21,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 615 transitions. [2024-11-19 00:40:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:40:21,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:21,138 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:21,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:40:21,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -67911810, now seen corresponding path program 1 times [2024-11-19 00:40:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505116358] [2024-11-19 00:40:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:21,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505116358] [2024-11-19 00:40:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505116358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:40:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228274404] [2024-11-19 00:40:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:40:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:40:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:40:21,226 INFO L87 Difference]: Start difference. First operand 452 states and 615 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:21,261 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2024-11-19 00:40:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:40:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2024-11-19 00:40:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:21,264 INFO L225 Difference]: With dead ends: 905 [2024-11-19 00:40:21,264 INFO L226 Difference]: Without dead ends: 456 [2024-11-19 00:40:21,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:40:21,266 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:21,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-19 00:40:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-11-19 00:40:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 406 states have (on average 1.3029556650246306) internal successors, (529), 409 states have internal predecessors, (529), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 619 transitions. [2024-11-19 00:40:21,300 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 619 transitions. Word has length 185 [2024-11-19 00:40:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:21,300 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 619 transitions. [2024-11-19 00:40:21,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 619 transitions. [2024-11-19 00:40:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:40:21,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:21,302 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:40:21,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:21,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1656259712, now seen corresponding path program 1 times [2024-11-19 00:40:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186185762] [2024-11-19 00:40:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186185762] [2024-11-19 00:40:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186185762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:21,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025194647] [2024-11-19 00:40:21,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:21,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:21,526 INFO L87 Difference]: Start difference. First operand 456 states and 619 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:21,677 INFO L93 Difference]: Finished difference Result 1136 states and 1549 transitions. [2024-11-19 00:40:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2024-11-19 00:40:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:21,681 INFO L225 Difference]: With dead ends: 1136 [2024-11-19 00:40:21,681 INFO L226 Difference]: Without dead ends: 683 [2024-11-19 00:40:21,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:21,683 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 108 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:21,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 829 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-19 00:40:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 444. [2024-11-19 00:40:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 394 states have (on average 1.2918781725888324) internal successors, (509), 397 states have internal predecessors, (509), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 599 transitions. [2024-11-19 00:40:21,715 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 599 transitions. Word has length 185 [2024-11-19 00:40:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:21,716 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 599 transitions. [2024-11-19 00:40:21,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 599 transitions. [2024-11-19 00:40:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:40:21,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:21,717 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:21,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:40:21,718 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:21,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1358843906, now seen corresponding path program 1 times [2024-11-19 00:40:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379916525] [2024-11-19 00:40:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379916525] [2024-11-19 00:40:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379916525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:21,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548661910] [2024-11-19 00:40:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:21,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:21,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:21,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:21,934 INFO L87 Difference]: Start difference. First operand 444 states and 599 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:21,990 INFO L93 Difference]: Finished difference Result 875 states and 1183 transitions. [2024-11-19 00:40:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2024-11-19 00:40:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:21,993 INFO L225 Difference]: With dead ends: 875 [2024-11-19 00:40:21,994 INFO L226 Difference]: Without dead ends: 434 [2024-11-19 00:40:21,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:21,995 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:21,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-19 00:40:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2024-11-19 00:40:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 382 states have (on average 1.2905759162303665) internal successors, (493), 385 states have internal predecessors, (493), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 583 transitions. [2024-11-19 00:40:22,021 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 583 transitions. Word has length 185 [2024-11-19 00:40:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:22,022 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 583 transitions. [2024-11-19 00:40:22,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 583 transitions. [2024-11-19 00:40:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 00:40:22,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:22,023 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:22,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:40:22,024 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:22,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:22,024 INFO L85 PathProgramCache]: Analyzing trace with hash -730884783, now seen corresponding path program 1 times [2024-11-19 00:40:22,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221172410] [2024-11-19 00:40:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221172410] [2024-11-19 00:40:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221172410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:22,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:40:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211957979] [2024-11-19 00:40:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:22,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:40:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:40:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:22,799 INFO L87 Difference]: Start difference. First operand 432 states and 583 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:23,119 INFO L93 Difference]: Finished difference Result 1098 states and 1479 transitions. [2024-11-19 00:40:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2024-11-19 00:40:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:23,124 INFO L225 Difference]: With dead ends: 1098 [2024-11-19 00:40:23,124 INFO L226 Difference]: Without dead ends: 669 [2024-11-19 00:40:23,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:40:23,125 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 153 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:23,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1202 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-19 00:40:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 496. [2024-11-19 00:40:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 446 states have (on average 1.2713004484304933) internal successors, (567), 449 states have internal predecessors, (567), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 657 transitions. [2024-11-19 00:40:23,157 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 657 transitions. Word has length 187 [2024-11-19 00:40:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 657 transitions. [2024-11-19 00:40:23,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 657 transitions. [2024-11-19 00:40:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 00:40:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:23,161 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:40:23,161 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash -472719345, now seen corresponding path program 1 times [2024-11-19 00:40:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881224884] [2024-11-19 00:40:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881224884] [2024-11-19 00:40:23,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881224884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:23,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:23,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:23,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224080575] [2024-11-19 00:40:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:23,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:23,270 INFO L87 Difference]: Start difference. First operand 496 states and 657 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:23,307 INFO L93 Difference]: Finished difference Result 1003 states and 1331 transitions. [2024-11-19 00:40:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:23,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2024-11-19 00:40:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:23,310 INFO L225 Difference]: With dead ends: 1003 [2024-11-19 00:40:23,310 INFO L226 Difference]: Without dead ends: 510 [2024-11-19 00:40:23,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:23,312 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:23,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-19 00:40:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-11-19 00:40:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 458 states have (on average 1.2641921397379912) internal successors, (579), 461 states have internal predecessors, (579), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:40:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 669 transitions. [2024-11-19 00:40:23,342 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 669 transitions. Word has length 187 [2024-11-19 00:40:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:23,342 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 669 transitions. [2024-11-19 00:40:23,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 669 transitions. [2024-11-19 00:40:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-19 00:40:23,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:23,344 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:23,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:40:23,345 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1725337417, now seen corresponding path program 1 times [2024-11-19 00:40:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:23,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116820181] [2024-11-19 00:40:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116820181] [2024-11-19 00:40:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116820181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656246465] [2024-11-19 00:40:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:24,366 INFO L87 Difference]: Start difference. First operand 508 states and 669 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:24,549 INFO L93 Difference]: Finished difference Result 1017 states and 1336 transitions. [2024-11-19 00:40:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2024-11-19 00:40:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:24,552 INFO L225 Difference]: With dead ends: 1017 [2024-11-19 00:40:24,552 INFO L226 Difference]: Without dead ends: 512 [2024-11-19 00:40:24,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:24,554 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 143 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:24,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 737 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-19 00:40:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 430. [2024-11-19 00:40:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 384 states have (on average 1.2421875) internal successors, (477), 385 states have internal predecessors, (477), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 00:40:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 559 transitions. [2024-11-19 00:40:24,580 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 559 transitions. Word has length 188 [2024-11-19 00:40:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 559 transitions. [2024-11-19 00:40:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 559 transitions. [2024-11-19 00:40:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:40:24,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:24,582 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:24,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:40:24,583 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:24,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1831826601, now seen corresponding path program 1 times [2024-11-19 00:40:24,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:24,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250619475] [2024-11-19 00:40:24,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250619475] [2024-11-19 00:40:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250619475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:24,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:24,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923697725] [2024-11-19 00:40:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:24,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:24,705 INFO L87 Difference]: Start difference. First operand 430 states and 559 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:24,745 INFO L93 Difference]: Finished difference Result 871 states and 1133 transitions. [2024-11-19 00:40:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 189 [2024-11-19 00:40:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:24,748 INFO L225 Difference]: With dead ends: 871 [2024-11-19 00:40:24,749 INFO L226 Difference]: Without dead ends: 444 [2024-11-19 00:40:24,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-19 00:40:24,750 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:24,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 664 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-19 00:40:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 438. [2024-11-19 00:40:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 392 states have (on average 1.2372448979591837) internal successors, (485), 393 states have internal predecessors, (485), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 00:40:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 567 transitions. [2024-11-19 00:40:24,775 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 567 transitions. Word has length 189 [2024-11-19 00:40:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:24,775 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 567 transitions. [2024-11-19 00:40:24,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 567 transitions. [2024-11-19 00:40:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:40:24,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:24,777 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:40:24,777 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 551962923, now seen corresponding path program 1 times [2024-11-19 00:40:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334459319] [2024-11-19 00:40:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334459319] [2024-11-19 00:40:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334459319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:25,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372037359] [2024-11-19 00:40:25,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:25,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:25,837 INFO L87 Difference]: Start difference. First operand 438 states and 567 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:26,051 INFO L93 Difference]: Finished difference Result 945 states and 1222 transitions. [2024-11-19 00:40:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2024-11-19 00:40:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:26,054 INFO L225 Difference]: With dead ends: 945 [2024-11-19 00:40:26,054 INFO L226 Difference]: Without dead ends: 510 [2024-11-19 00:40:26,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:26,056 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 62 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:26,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 753 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-19 00:40:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 438. [2024-11-19 00:40:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 392 states have (on average 1.2321428571428572) internal successors, (483), 393 states have internal predecessors, (483), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 00:40:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2024-11-19 00:40:26,084 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 189 [2024-11-19 00:40:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:26,085 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2024-11-19 00:40:26,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2024-11-19 00:40:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:26,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:26,087 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:26,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 00:40:26,087 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 346704995, now seen corresponding path program 1 times [2024-11-19 00:40:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009172457] [2024-11-19 00:40:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009172457] [2024-11-19 00:40:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009172457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534258538] [2024-11-19 00:40:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:27,026 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:27,277 INFO L93 Difference]: Finished difference Result 1037 states and 1332 transitions. [2024-11-19 00:40:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:27,281 INFO L225 Difference]: With dead ends: 1037 [2024-11-19 00:40:27,281 INFO L226 Difference]: Without dead ends: 602 [2024-11-19 00:40:27,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:27,282 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 129 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:27,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 776 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-19 00:40:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-19 00:40:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 540 states have (on average 1.2351851851851852) internal successors, (667), 543 states have internal predecessors, (667), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 00:40:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 765 transitions. [2024-11-19 00:40:27,322 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 765 transitions. Word has length 190 [2024-11-19 00:40:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 765 transitions. [2024-11-19 00:40:27,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 765 transitions. [2024-11-19 00:40:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:27,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:27,324 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:27,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:40:27,325 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 594851489, now seen corresponding path program 1 times [2024-11-19 00:40:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609367772] [2024-11-19 00:40:27,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609367772] [2024-11-19 00:40:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609367772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:40:28,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138288954] [2024-11-19 00:40:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:40:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:28,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:40:28,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:28,196 INFO L87 Difference]: Start difference. First operand 598 states and 765 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:28,606 INFO L93 Difference]: Finished difference Result 1291 states and 1650 transitions. [2024-11-19 00:40:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:40:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:28,610 INFO L225 Difference]: With dead ends: 1291 [2024-11-19 00:40:28,610 INFO L226 Difference]: Without dead ends: 696 [2024-11-19 00:40:28,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:40:28,613 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 74 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:28,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1588 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-19 00:40:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 684. [2024-11-19 00:40:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 610 states have (on average 1.2344262295081967) internal successors, (753), 615 states have internal predecessors, (753), 61 states have call successors, (61), 12 states have call predecessors, (61), 12 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:40:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 875 transitions. [2024-11-19 00:40:28,660 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 875 transitions. Word has length 190 [2024-11-19 00:40:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:28,660 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 875 transitions. [2024-11-19 00:40:28,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 875 transitions. [2024-11-19 00:40:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:28,662 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:40:28,663 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -228817437, now seen corresponding path program 1 times [2024-11-19 00:40:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649764268] [2024-11-19 00:40:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649764268] [2024-11-19 00:40:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649764268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833369884] [2024-11-19 00:40:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:29,553 INFO L87 Difference]: Start difference. First operand 684 states and 875 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:29,740 INFO L93 Difference]: Finished difference Result 1445 states and 1846 transitions. [2024-11-19 00:40:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:29,744 INFO L225 Difference]: With dead ends: 1445 [2024-11-19 00:40:29,744 INFO L226 Difference]: Without dead ends: 764 [2024-11-19 00:40:29,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:29,746 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 143 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:29,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 663 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-19 00:40:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 686. [2024-11-19 00:40:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 610 states have (on average 1.2278688524590164) internal successors, (749), 615 states have internal predecessors, (749), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:40:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 871 transitions. [2024-11-19 00:40:29,789 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 871 transitions. Word has length 190 [2024-11-19 00:40:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:29,789 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 871 transitions. [2024-11-19 00:40:29,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 871 transitions. [2024-11-19 00:40:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:29,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:29,791 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:29,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 00:40:29,792 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:29,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1508681115, now seen corresponding path program 1 times [2024-11-19 00:40:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:29,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661464996] [2024-11-19 00:40:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661464996] [2024-11-19 00:40:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661464996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:30,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:40:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075732136] [2024-11-19 00:40:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:40:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:40:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:30,569 INFO L87 Difference]: Start difference. First operand 686 states and 871 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:30,888 INFO L93 Difference]: Finished difference Result 1463 states and 1856 transitions. [2024-11-19 00:40:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:40:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:30,892 INFO L225 Difference]: With dead ends: 1463 [2024-11-19 00:40:30,892 INFO L226 Difference]: Without dead ends: 780 [2024-11-19 00:40:30,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:40:30,894 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 78 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:30,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1355 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-19 00:40:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 686. [2024-11-19 00:40:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 610 states have (on average 1.2245901639344263) internal successors, (747), 615 states have internal predecessors, (747), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:40:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 869 transitions. [2024-11-19 00:40:30,953 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 869 transitions. Word has length 190 [2024-11-19 00:40:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:30,954 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 869 transitions. [2024-11-19 00:40:30,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 869 transitions. [2024-11-19 00:40:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:30,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:30,956 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:40:30,956 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1250515677, now seen corresponding path program 1 times [2024-11-19 00:40:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984125219] [2024-11-19 00:40:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984125219] [2024-11-19 00:40:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984125219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:40:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795436730] [2024-11-19 00:40:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:32,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:40:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:40:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:32,386 INFO L87 Difference]: Start difference. First operand 686 states and 869 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:32,974 INFO L93 Difference]: Finished difference Result 1493 states and 1897 transitions. [2024-11-19 00:40:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:40:32,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:32,979 INFO L225 Difference]: With dead ends: 1493 [2024-11-19 00:40:32,979 INFO L226 Difference]: Without dead ends: 810 [2024-11-19 00:40:32,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:40:32,982 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 113 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:32,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1811 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-11-19 00:40:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 712. [2024-11-19 00:40:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 636 states have (on average 1.2185534591194969) internal successors, (775), 641 states have internal predecessors, (775), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:40:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 897 transitions. [2024-11-19 00:40:33,061 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 897 transitions. Word has length 190 [2024-11-19 00:40:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:33,061 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 897 transitions. [2024-11-19 00:40:33,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 897 transitions. [2024-11-19 00:40:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:40:33,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:33,065 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 00:40:33,065 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1619440157, now seen corresponding path program 1 times [2024-11-19 00:40:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034597177] [2024-11-19 00:40:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:34,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034597177] [2024-11-19 00:40:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034597177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:40:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760286227] [2024-11-19 00:40:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:34,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:40:34,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:40:34,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:34,526 INFO L87 Difference]: Start difference. First operand 712 states and 897 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:34,917 INFO L93 Difference]: Finished difference Result 1497 states and 1888 transitions. [2024-11-19 00:40:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:40:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2024-11-19 00:40:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:34,922 INFO L225 Difference]: With dead ends: 1497 [2024-11-19 00:40:34,922 INFO L226 Difference]: Without dead ends: 788 [2024-11-19 00:40:34,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:40:34,924 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 154 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:34,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1230 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-19 00:40:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 710. [2024-11-19 00:40:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 634 states have (on average 1.2192429022082019) internal successors, (773), 639 states have internal predecessors, (773), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:40:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 895 transitions. [2024-11-19 00:40:34,977 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 895 transitions. Word has length 190 [2024-11-19 00:40:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:34,977 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 895 transitions. [2024-11-19 00:40:34,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 895 transitions. [2024-11-19 00:40:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:34,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:34,981 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:34,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 00:40:34,982 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:34,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:34,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2017948219, now seen corresponding path program 1 times [2024-11-19 00:40:34,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529405625] [2024-11-19 00:40:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529405625] [2024-11-19 00:40:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529405625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:40:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831552730] [2024-11-19 00:40:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:35,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:40:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:40:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:35,721 INFO L87 Difference]: Start difference. First operand 710 states and 895 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:36,242 INFO L93 Difference]: Finished difference Result 1906 states and 2420 transitions. [2024-11-19 00:40:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:40:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2024-11-19 00:40:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:36,248 INFO L225 Difference]: With dead ends: 1906 [2024-11-19 00:40:36,248 INFO L226 Difference]: Without dead ends: 1199 [2024-11-19 00:40:36,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:36,250 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 267 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:36,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1343 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-19 00:40:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1080. [2024-11-19 00:40:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 939 states have (on average 1.194888178913738) internal successors, (1122), 948 states have internal predecessors, (1122), 114 states have call successors, (114), 26 states have call predecessors, (114), 26 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-19 00:40:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1350 transitions. [2024-11-19 00:40:36,343 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1350 transitions. Word has length 191 [2024-11-19 00:40:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:36,344 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1350 transitions. [2024-11-19 00:40:36,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1350 transitions. [2024-11-19 00:40:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:36,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:36,347 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:36,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 00:40:36,348 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash -196934681, now seen corresponding path program 1 times [2024-11-19 00:40:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406618797] [2024-11-19 00:40:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406618797] [2024-11-19 00:40:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406618797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103187673] [2024-11-19 00:40:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:36,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:36,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:36,444 INFO L87 Difference]: Start difference. First operand 1080 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:36,549 INFO L93 Difference]: Finished difference Result 2187 states and 2737 transitions. [2024-11-19 00:40:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2024-11-19 00:40:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:36,557 INFO L225 Difference]: With dead ends: 2187 [2024-11-19 00:40:36,557 INFO L226 Difference]: Without dead ends: 1110 [2024-11-19 00:40:36,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:36,561 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:36,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-19 00:40:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1100. [2024-11-19 00:40:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 959 states have (on average 1.1908237747653807) internal successors, (1142), 968 states have internal predecessors, (1142), 114 states have call successors, (114), 26 states have call predecessors, (114), 26 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-19 00:40:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1370 transitions. [2024-11-19 00:40:36,640 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1370 transitions. Word has length 191 [2024-11-19 00:40:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1370 transitions. [2024-11-19 00:40:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1370 transitions. [2024-11-19 00:40:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:36,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:36,643 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:36,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 00:40:36,644 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:36,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -589961691, now seen corresponding path program 1 times [2024-11-19 00:40:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:36,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836502950] [2024-11-19 00:40:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836502950] [2024-11-19 00:40:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836502950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:37,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581778108] [2024-11-19 00:40:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:37,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:37,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:37,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:37,202 INFO L87 Difference]: Start difference. First operand 1100 states and 1370 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:37,588 INFO L93 Difference]: Finished difference Result 3151 states and 3904 transitions. [2024-11-19 00:40:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2024-11-19 00:40:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:37,600 INFO L225 Difference]: With dead ends: 3151 [2024-11-19 00:40:37,601 INFO L226 Difference]: Without dead ends: 2054 [2024-11-19 00:40:37,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:37,604 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 143 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:37,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 599 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-11-19 00:40:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2048. [2024-11-19 00:40:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1809 states have (on average 1.1885019347705914) internal successors, (2150), 1828 states have internal predecessors, (2150), 186 states have call successors, (186), 52 states have call predecessors, (186), 52 states have return successors, (186), 167 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-19 00:40:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2522 transitions. [2024-11-19 00:40:37,860 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2522 transitions. Word has length 191 [2024-11-19 00:40:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 2522 transitions. [2024-11-19 00:40:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2522 transitions. [2024-11-19 00:40:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:37,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:37,865 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:37,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 00:40:37,865 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:37,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash -455100119, now seen corresponding path program 1 times [2024-11-19 00:40:37,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68560591] [2024-11-19 00:40:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68560591] [2024-11-19 00:40:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68560591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:38,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:40:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008842569] [2024-11-19 00:40:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:38,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:40:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:40:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:39,000 INFO L87 Difference]: Start difference. First operand 2048 states and 2522 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:39,707 INFO L93 Difference]: Finished difference Result 5949 states and 7278 transitions. [2024-11-19 00:40:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:40:39,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2024-11-19 00:40:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:39,722 INFO L225 Difference]: With dead ends: 5949 [2024-11-19 00:40:39,722 INFO L226 Difference]: Without dead ends: 3904 [2024-11-19 00:40:39,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:40:39,727 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 84 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:39,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1275 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2024-11-19 00:40:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3876. [2024-11-19 00:40:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3457 states have (on average 1.1790569858258606) internal successors, (4076), 3496 states have internal predecessors, (4076), 314 states have call successors, (314), 104 states have call predecessors, (314), 104 states have return successors, (314), 275 states have call predecessors, (314), 314 states have call successors, (314) [2024-11-19 00:40:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4704 transitions. [2024-11-19 00:40:40,010 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4704 transitions. Word has length 191 [2024-11-19 00:40:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:40,011 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 4704 transitions. [2024-11-19 00:40:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4704 transitions. [2024-11-19 00:40:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:40,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:40,017 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:40,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 00:40:40,017 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:40,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1484459417, now seen corresponding path program 1 times [2024-11-19 00:40:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903184381] [2024-11-19 00:40:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903184381] [2024-11-19 00:40:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903184381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:40,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:40,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:40:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863053228] [2024-11-19 00:40:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:40,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:40:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:40:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:40,666 INFO L87 Difference]: Start difference. First operand 3876 states and 4704 transitions. Second operand has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:41,224 INFO L93 Difference]: Finished difference Result 8776 states and 10630 transitions. [2024-11-19 00:40:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:40:41,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2024-11-19 00:40:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:41,244 INFO L225 Difference]: With dead ends: 8776 [2024-11-19 00:40:41,244 INFO L226 Difference]: Without dead ends: 4903 [2024-11-19 00:40:41,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:41,253 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 146 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:41,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1075 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. [2024-11-19 00:40:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 4857. [2024-11-19 00:40:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 4315 states have (on average 1.1740440324449595) internal successors, (5066), 4365 states have internal predecessors, (5066), 404 states have call successors, (404), 137 states have call predecessors, (404), 137 states have return successors, (404), 354 states have call predecessors, (404), 404 states have call successors, (404) [2024-11-19 00:40:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 5874 transitions. [2024-11-19 00:40:41,604 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 5874 transitions. Word has length 191 [2024-11-19 00:40:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:41,604 INFO L471 AbstractCegarLoop]: Abstraction has 4857 states and 5874 transitions. [2024-11-19 00:40:41,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 5874 transitions. [2024-11-19 00:40:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:41,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:41,611 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:41,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 00:40:41,611 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:41,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1877486427, now seen corresponding path program 1 times [2024-11-19 00:40:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934135545] [2024-11-19 00:40:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934135545] [2024-11-19 00:40:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934135545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:40:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923171435] [2024-11-19 00:40:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:42,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:40:42,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:42,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:40:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:42,035 INFO L87 Difference]: Start difference. First operand 4857 states and 5874 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:42,645 INFO L93 Difference]: Finished difference Result 10849 states and 13159 transitions. [2024-11-19 00:40:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:42,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2024-11-19 00:40:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:42,661 INFO L225 Difference]: With dead ends: 10849 [2024-11-19 00:40:42,661 INFO L226 Difference]: Without dead ends: 6028 [2024-11-19 00:40:42,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:40:42,671 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 144 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:42,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2069 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2024-11-19 00:40:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5407. [2024-11-19 00:40:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5407 states, 4862 states have (on average 1.169683257918552) internal successors, (5687), 4912 states have internal predecessors, (5687), 406 states have call successors, (406), 138 states have call predecessors, (406), 138 states have return successors, (406), 356 states have call predecessors, (406), 406 states have call successors, (406) [2024-11-19 00:40:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 6499 transitions. [2024-11-19 00:40:43,099 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 6499 transitions. Word has length 191 [2024-11-19 00:40:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:43,100 INFO L471 AbstractCegarLoop]: Abstraction has 5407 states and 6499 transitions. [2024-11-19 00:40:43,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:40:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 6499 transitions. [2024-11-19 00:40:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:40:43,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:43,107 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:43,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 00:40:43,107 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1438700581, now seen corresponding path program 1 times [2024-11-19 00:40:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154845836] [2024-11-19 00:40:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154845836] [2024-11-19 00:40:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154845836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152769039] [2024-11-19 00:40:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:43,733 INFO L87 Difference]: Start difference. First operand 5407 states and 6499 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:44,191 INFO L93 Difference]: Finished difference Result 10736 states and 12876 transitions. [2024-11-19 00:40:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2024-11-19 00:40:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:44,205 INFO L225 Difference]: With dead ends: 10736 [2024-11-19 00:40:44,206 INFO L226 Difference]: Without dead ends: 5373 [2024-11-19 00:40:44,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:44,215 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 145 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:44,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 710 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2024-11-19 00:40:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 4449. [2024-11-19 00:40:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4119 states have (on average 1.1536780772032047) internal successors, (4752), 4149 states have internal predecessors, (4752), 243 states have call successors, (243), 86 states have call predecessors, (243), 86 states have return successors, (243), 213 states have call predecessors, (243), 243 states have call successors, (243) [2024-11-19 00:40:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 5238 transitions. [2024-11-19 00:40:44,492 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 5238 transitions. Word has length 191 [2024-11-19 00:40:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:44,492 INFO L471 AbstractCegarLoop]: Abstraction has 4449 states and 5238 transitions. [2024-11-19 00:40:44,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 5238 transitions. [2024-11-19 00:40:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:40:44,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:44,498 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:44,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 00:40:44,499 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:44,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1633060821, now seen corresponding path program 1 times [2024-11-19 00:40:44,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:44,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482930753] [2024-11-19 00:40:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:45,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482930753] [2024-11-19 00:40:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482930753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:40:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179447873] [2024-11-19 00:40:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:40:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:40:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:40:45,761 INFO L87 Difference]: Start difference. First operand 4449 states and 5238 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:46,721 INFO L93 Difference]: Finished difference Result 12489 states and 14629 transitions. [2024-11-19 00:40:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:40:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2024-11-19 00:40:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:46,737 INFO L225 Difference]: With dead ends: 12489 [2024-11-19 00:40:46,737 INFO L226 Difference]: Without dead ends: 8080 [2024-11-19 00:40:46,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:40:46,746 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 320 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:46,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 2234 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:40:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8080 states. [2024-11-19 00:40:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8080 to 4593. [2024-11-19 00:40:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4263 states have (on average 1.1541168191414497) internal successors, (4920), 4293 states have internal predecessors, (4920), 243 states have call successors, (243), 86 states have call predecessors, (243), 86 states have return successors, (243), 213 states have call predecessors, (243), 243 states have call successors, (243) [2024-11-19 00:40:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 5406 transitions. [2024-11-19 00:40:47,084 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 5406 transitions. Word has length 192 [2024-11-19 00:40:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:47,085 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 5406 transitions. [2024-11-19 00:40:47,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 5406 transitions. [2024-11-19 00:40:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:40:47,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:47,091 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:47,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 00:40:47,091 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1358301207, now seen corresponding path program 1 times [2024-11-19 00:40:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722450050] [2024-11-19 00:40:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722450050] [2024-11-19 00:40:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722450050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890332034] [2024-11-19 00:40:47,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:47,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:47,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:47,628 INFO L87 Difference]: Start difference. First operand 4593 states and 5406 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:47,995 INFO L93 Difference]: Finished difference Result 8816 states and 10383 transitions. [2024-11-19 00:40:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2024-11-19 00:40:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:48,007 INFO L225 Difference]: With dead ends: 8816 [2024-11-19 00:40:48,008 INFO L226 Difference]: Without dead ends: 4263 [2024-11-19 00:40:48,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:48,015 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 89 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:48,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 851 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2024-11-19 00:40:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4261. [2024-11-19 00:40:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3931 states have (on average 1.1477995421012466) internal successors, (4512), 3961 states have internal predecessors, (4512), 243 states have call successors, (243), 86 states have call predecessors, (243), 86 states have return successors, (243), 213 states have call predecessors, (243), 243 states have call successors, (243) [2024-11-19 00:40:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 4998 transitions. [2024-11-19 00:40:48,467 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 4998 transitions. Word has length 192 [2024-11-19 00:40:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:48,468 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 4998 transitions. [2024-11-19 00:40:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:40:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 4998 transitions. [2024-11-19 00:40:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:40:48,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:48,476 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-19 00:40:48,476 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1417294, now seen corresponding path program 1 times [2024-11-19 00:40:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688435489] [2024-11-19 00:40:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:49,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:49,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688435489] [2024-11-19 00:40:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688435489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:40:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769720893] [2024-11-19 00:40:49,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:49,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:40:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:49,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:40:49,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:49,552 INFO L87 Difference]: Start difference. First operand 4261 states and 4998 transitions. Second operand has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:50,468 INFO L93 Difference]: Finished difference Result 10230 states and 11995 transitions. [2024-11-19 00:40:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:40:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2024-11-19 00:40:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:50,484 INFO L225 Difference]: With dead ends: 10230 [2024-11-19 00:40:50,485 INFO L226 Difference]: Without dead ends: 6009 [2024-11-19 00:40:50,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:40:50,492 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 137 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:50,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1580 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:50,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2024-11-19 00:40:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5115. [2024-11-19 00:40:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4695 states have (on average 1.1463258785942492) internal successors, (5382), 4735 states have internal predecessors, (5382), 307 states have call successors, (307), 112 states have call predecessors, (307), 112 states have return successors, (307), 267 states have call predecessors, (307), 307 states have call successors, (307) [2024-11-19 00:40:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 5996 transitions. [2024-11-19 00:40:50,884 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 5996 transitions. Word has length 193 [2024-11-19 00:40:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:50,885 INFO L471 AbstractCegarLoop]: Abstraction has 5115 states and 5996 transitions. [2024-11-19 00:40:50,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 5996 transitions. [2024-11-19 00:40:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:40:50,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:50,894 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-19 00:40:50,895 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:50,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash -391609716, now seen corresponding path program 1 times [2024-11-19 00:40:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740043647] [2024-11-19 00:40:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740043647] [2024-11-19 00:40:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740043647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:40:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554186704] [2024-11-19 00:40:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:40:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:40:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:51,361 INFO L87 Difference]: Start difference. First operand 5115 states and 5996 transitions. Second operand has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:51,966 INFO L93 Difference]: Finished difference Result 11096 states and 13001 transitions. [2024-11-19 00:40:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:40:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2024-11-19 00:40:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:51,978 INFO L225 Difference]: With dead ends: 11096 [2024-11-19 00:40:51,978 INFO L226 Difference]: Without dead ends: 6021 [2024-11-19 00:40:51,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:51,985 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 202 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:51,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1016 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:40:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2024-11-19 00:40:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5543. [2024-11-19 00:40:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 5027 states have (on average 1.1446190570917048) internal successors, (5754), 5077 states have internal predecessors, (5754), 375 states have call successors, (375), 140 states have call predecessors, (375), 140 states have return successors, (375), 325 states have call predecessors, (375), 375 states have call successors, (375) [2024-11-19 00:40:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 6504 transitions. [2024-11-19 00:40:52,426 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 6504 transitions. Word has length 193 [2024-11-19 00:40:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:52,427 INFO L471 AbstractCegarLoop]: Abstraction has 5543 states and 6504 transitions. [2024-11-19 00:40:52,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:40:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 6504 transitions. [2024-11-19 00:40:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:40:52,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:52,434 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:52,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-19 00:40:52,435 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1819775333, now seen corresponding path program 1 times [2024-11-19 00:40:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:52,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929423425] [2024-11-19 00:40:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929423425] [2024-11-19 00:40:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929423425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279623954] [2024-11-19 00:40:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:53,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:53,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:53,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:53,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:40:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:40:53,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:53,481 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 33 treesize of output 17 [2024-11-19 00:40:53,507 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 33 treesize of output 17 [2024-11-19 00:40:53,633 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 52 treesize of output 38 [2024-11-19 00:40:53,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-11-19 00:40:53,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:53,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2024-11-19 00:40:53,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:53,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 51 [2024-11-19 00:40:53,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 54 [2024-11-19 00:40:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-19 00:40:54,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279623954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:40:54,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:40:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 17 [2024-11-19 00:40:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853929783] [2024-11-19 00:40:54,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:40:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:40:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:40:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:40:54,526 INFO L87 Difference]: Start difference. First operand 5543 states and 6504 transitions. Second operand has 17 states, 15 states have (on average 10.6) internal successors, (159), 17 states have internal predecessors, (159), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-19 00:40:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:55,961 INFO L93 Difference]: Finished difference Result 11119 states and 13017 transitions. [2024-11-19 00:40:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 00:40:55,961 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 10.6) internal successors, (159), 17 states have internal predecessors, (159), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 193 [2024-11-19 00:40:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:55,975 INFO L225 Difference]: With dead ends: 11119 [2024-11-19 00:40:55,975 INFO L226 Difference]: Without dead ends: 5616 [2024-11-19 00:40:55,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 378 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:40:55,983 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 465 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:55,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1190 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:40:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2024-11-19 00:40:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 3473. [2024-11-19 00:40:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3111 states have (on average 1.1423979427836708) internal successors, (3554), 3141 states have internal predecessors, (3554), 259 states have call successors, (259), 102 states have call predecessors, (259), 102 states have return successors, (259), 229 states have call predecessors, (259), 259 states have call successors, (259) [2024-11-19 00:40:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4072 transitions. [2024-11-19 00:40:56,266 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4072 transitions. Word has length 193 [2024-11-19 00:40:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:56,266 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 4072 transitions. [2024-11-19 00:40:56,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 10.6) internal successors, (159), 17 states have internal predecessors, (159), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-19 00:40:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4072 transitions. [2024-11-19 00:40:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:40:56,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:56,271 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:56,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:56,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-19 00:40:56,472 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:56,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1361550103, now seen corresponding path program 1 times [2024-11-19 00:40:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504026315] [2024-11-19 00:40:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504026315] [2024-11-19 00:40:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504026315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19522788] [2024-11-19 00:40:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:56,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:56,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:56,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:56,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 00:40:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:57,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:40:57,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:57,285 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 52 treesize of output 38 [2024-11-19 00:40:57,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-11-19 00:40:57,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2024-11-19 00:40:57,345 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 86 treesize of output 66 [2024-11-19 00:40:57,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 94 [2024-11-19 00:40:57,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54 [2024-11-19 00:40:57,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 83 [2024-11-19 00:40:57,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 73 [2024-11-19 00:40:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 526 proven. 30 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2024-11-19 00:40:58,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:40:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19522788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:40:58,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:40:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2024-11-19 00:40:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486502832] [2024-11-19 00:40:58,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:40:58,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:40:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:40:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:40:58,305 INFO L87 Difference]: Start difference. First operand 3473 states and 4072 transitions. Second operand has 16 states, 13 states have (on average 11.76923076923077) internal successors, (153), 16 states have internal predecessors, (153), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 00:40:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:59,302 INFO L93 Difference]: Finished difference Result 6137 states and 7163 transitions. [2024-11-19 00:40:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 00:40:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 11.76923076923077) internal successors, (153), 16 states have internal predecessors, (153), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) Word has length 193 [2024-11-19 00:40:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:59,311 INFO L225 Difference]: With dead ends: 6137 [2024-11-19 00:40:59,311 INFO L226 Difference]: Without dead ends: 2702 [2024-11-19 00:40:59,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 378 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:40:59,315 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 211 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:59,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1059 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:40:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-19 00:40:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2109. [2024-11-19 00:40:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 1970 states have (on average 1.133502538071066) internal successors, (2233), 1980 states have internal predecessors, (2233), 98 states have call successors, (98), 40 states have call predecessors, (98), 40 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-19 00:40:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2429 transitions. [2024-11-19 00:40:59,473 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2429 transitions. Word has length 193 [2024-11-19 00:40:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:59,473 INFO L471 AbstractCegarLoop]: Abstraction has 2109 states and 2429 transitions. [2024-11-19 00:40:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 11.76923076923077) internal successors, (153), 16 states have internal predecessors, (153), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-19 00:40:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2429 transitions. [2024-11-19 00:40:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:40:59,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:59,477 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:59,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:59,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:59,677 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash 114702216, now seen corresponding path program 1 times [2024-11-19 00:40:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672657814] [2024-11-19 00:40:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:40:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672657814] [2024-11-19 00:40:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672657814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896724283] [2024-11-19 00:40:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:59,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:59,835 INFO L87 Difference]: Start difference. First operand 2109 states and 2429 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:41:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:00,025 INFO L93 Difference]: Finished difference Result 3676 states and 4247 transitions. [2024-11-19 00:41:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:41:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 193 [2024-11-19 00:41:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:00,031 INFO L225 Difference]: With dead ends: 3676 [2024-11-19 00:41:00,031 INFO L226 Difference]: Without dead ends: 1605 [2024-11-19 00:41:00,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:00,034 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:00,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-19 00:41:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-11-19 00:41:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1466 states have (on average 1.130286493860846) internal successors, (1657), 1476 states have internal predecessors, (1657), 98 states have call successors, (98), 40 states have call predecessors, (98), 40 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-19 00:41:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1853 transitions. [2024-11-19 00:41:00,263 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1853 transitions. Word has length 193 [2024-11-19 00:41:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:00,264 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1853 transitions. [2024-11-19 00:41:00,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-19 00:41:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1853 transitions. [2024-11-19 00:41:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:41:00,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:00,267 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-19 00:41:00,268 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash 598579347, now seen corresponding path program 1 times [2024-11-19 00:41:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269039842] [2024-11-19 00:41:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:41:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269039842] [2024-11-19 00:41:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269039842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583746917] [2024-11-19 00:41:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:00,803 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:00,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 00:41:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:01,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:41:01,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:01,140 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 33 treesize of output 17 [2024-11-19 00:41:01,263 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 52 treesize of output 38 [2024-11-19 00:41:01,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-11-19 00:41:01,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:01,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2024-11-19 00:41:01,322 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 86 treesize of output 66 [2024-11-19 00:41:01,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:01,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 94 [2024-11-19 00:41:01,351 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 57 treesize of output 54 [2024-11-19 00:41:01,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 83 [2024-11-19 00:41:02,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:02,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 73 [2024-11-19 00:41:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 522 proven. 36 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-19 00:41:02,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:41:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583746917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:41:02,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:41:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 14 [2024-11-19 00:41:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109288283] [2024-11-19 00:41:02,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:41:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:41:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:41:02,281 INFO L87 Difference]: Start difference. First operand 1605 states and 1853 transitions. Second operand has 14 states, 11 states have (on average 13.727272727272727) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) [2024-11-19 00:41:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:03,011 INFO L93 Difference]: Finished difference Result 2719 states and 3136 transitions. [2024-11-19 00:41:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 00:41:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 13.727272727272727) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) Word has length 193 [2024-11-19 00:41:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:03,015 INFO L225 Difference]: With dead ends: 2719 [2024-11-19 00:41:03,015 INFO L226 Difference]: Without dead ends: 1152 [2024-11-19 00:41:03,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 378 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:41:03,017 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 84 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:03,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 792 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:41:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-19 00:41:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1083. [2024-11-19 00:41:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 942 states have (on average 1.1178343949044587) internal successors, (1053), 952 states have internal predecessors, (1053), 98 states have call successors, (98), 42 states have call predecessors, (98), 42 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-19 00:41:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1249 transitions. [2024-11-19 00:41:03,166 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1249 transitions. Word has length 193 [2024-11-19 00:41:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:03,166 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1249 transitions. [2024-11-19 00:41:03,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 13.727272727272727) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) [2024-11-19 00:41:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1249 transitions. [2024-11-19 00:41:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 00:41:03,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:03,169 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:03,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 00:41:03,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:03,370 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:03,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1466335131, now seen corresponding path program 1 times [2024-11-19 00:41:03,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:03,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723612150] [2024-11-19 00:41:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:41:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723612150] [2024-11-19 00:41:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723612150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645567375] [2024-11-19 00:41:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:03,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:03,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:03,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 00:41:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:04,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:41:04,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:04,154 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 89 treesize of output 55 [2024-11-19 00:41:04,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:04,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2024-11-19 00:41:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 00:41:04,623 INFO L311 TraceCheckSpWp]: Computing backward predicates...