./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_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-ap_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 a747c3e70b2dac762cd875ff4c6b8c1b6f4dc1a373b46f7848c57180a86a2166 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:50:39,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:50:39,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:50:39,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:50:39,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:50:39,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:50:39,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:50:39,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:50:39,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:50:39,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:50:39,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:50:39,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:50:39,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:50:39,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:50:39,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:50:39,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:50:39,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:50:39,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:50:39,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:50:39,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:50:39,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:50:39,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:50:39,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:50:39,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:50:39,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:50:39,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:50:39,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:50:39,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:50:39,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:50:39,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:50:39,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:50:39,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:50:39,827 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 -> a747c3e70b2dac762cd875ff4c6b8c1b6f4dc1a373b46f7848c57180a86a2166 [2024-11-19 00:50:40,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:50:40,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:50:40,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:50:40,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:50:40,109 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:50:40,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-85.i [2024-11-19 00:50:41,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:50:41,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:50:41,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-85.i [2024-11-19 00:50:41,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7aa13367/3c4aa5c26cb74cc9b9d6376d7aa16e34/FLAGa399833eb [2024-11-19 00:50:41,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7aa13367/3c4aa5c26cb74cc9b9d6376d7aa16e34 [2024-11-19 00:50:41,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:50:41,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:50:41,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:50:41,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:50:41,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:50:41,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:50:41" (1/1) ... [2024-11-19 00:50:41,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a8d0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:41, skipping insertion in model container [2024-11-19 00:50:41,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:50:41" (1/1) ... [2024-11-19 00:50:41,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:50:41,966 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-ap_file-85.i[917,930] [2024-11-19 00:50:42,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:50:42,051 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:50:42,060 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-ap_file-85.i[917,930] [2024-11-19 00:50:42,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:50:42,129 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:50:42,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42 WrapperNode [2024-11-19 00:50:42,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:50:42,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:50:42,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:50:42,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:50:42,141 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:50:42" (1/1) ... [2024-11-19 00:50:42,158 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:50:42" (1/1) ... [2024-11-19 00:50:42,200 INFO L138 Inliner]: procedures = 27, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2024-11-19 00:50:42,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:50:42,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:50:42,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:50:42,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:50:42,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,259 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:50:42,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:50:42,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:50:42,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:50:42,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:50:42,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (1/1) ... [2024-11-19 00:50:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:50:42,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:50:42,343 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:50:42,350 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:50:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:50:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 00:50:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 00:50:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:50:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:50:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:50:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:50:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:50:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:50:42,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:50:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:50:42,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:50:42,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:50:42,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:50:42,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:50:43,013 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-19 00:50:43,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:50:43,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:50:43,030 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:50:43,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:50:43 BoogieIcfgContainer [2024-11-19 00:50:43,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:50:43,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:50:43,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:50:43,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:50:43,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:50:41" (1/3) ... [2024-11-19 00:50:43,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d882bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:50:43, skipping insertion in model container [2024-11-19 00:50:43,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:50:42" (2/3) ... [2024-11-19 00:50:43,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d882bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:50:43, skipping insertion in model container [2024-11-19 00:50:43,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:50:43" (3/3) ... [2024-11-19 00:50:43,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-85.i [2024-11-19 00:50:43,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:50:43,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:50:43,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:50:43,122 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;@68436bf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:50:43,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:50:43,127 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:50:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 00:50:43,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:43,144 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:50:43,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:43,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash -632733008, now seen corresponding path program 1 times [2024-11-19 00:50:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053773121] [2024-11-19 00:50:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:43,538 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:50:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053773121] [2024-11-19 00:50:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053773121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:50:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716403189] [2024-11-19 00:50:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:50:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:50:43,543 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:50:43,549 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:50:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:43,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:50:43,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:50:43,817 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:50:43,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:50:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716403189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:43,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:50:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:50:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395445537] [2024-11-19 00:50:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:43,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:50:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:50:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:50:43,851 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:50:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:43,878 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-19 00:50:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:50:43,880 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:50:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:43,888 INFO L225 Difference]: With dead ends: 255 [2024-11-19 00:50:43,888 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 00:50:43,891 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:50:43,894 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:50:43,895 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:50:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 00:50:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 00:50:43,927 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:50:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2024-11-19 00:50:43,931 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2024-11-19 00:50:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:43,931 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2024-11-19 00:50:43,931 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:50:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2024-11-19 00:50:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 00:50:43,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:43,935 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:50:43,950 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:50:44,139 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:50:44,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -493224382, now seen corresponding path program 1 times [2024-11-19 00:50:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160434505] [2024-11-19 00:50:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:46,717 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:50:46,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160434505] [2024-11-19 00:50:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160434505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:46,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:46,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:50:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061595356] [2024-11-19 00:50:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:46,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:50:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:50:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:50:46,722 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:50:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:47,313 INFO L93 Difference]: Finished difference Result 325 states and 469 transitions. [2024-11-19 00:50:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:50:47,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 179 [2024-11-19 00:50:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:47,321 INFO L225 Difference]: With dead ends: 325 [2024-11-19 00:50:47,321 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 00:50:47,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:50:47,325 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 486 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:47,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 715 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:50:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 00:50:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2024-11-19 00:50:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.3832335329341316) internal successors, (231), 168 states have internal predecessors, (231), 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:50:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 281 transitions. [2024-11-19 00:50:47,360 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 281 transitions. Word has length 179 [2024-11-19 00:50:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:47,361 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 281 transitions. [2024-11-19 00:50:47,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:50:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 281 transitions. [2024-11-19 00:50:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:47,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:47,365 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:50:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:50:47,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1535301185, now seen corresponding path program 1 times [2024-11-19 00:50:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663168657] [2024-11-19 00:50:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:47,635 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:50:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663168657] [2024-11-19 00:50:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663168657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:47,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:50:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383621282] [2024-11-19 00:50:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:47,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:50:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:50:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:50:47,639 INFO L87 Difference]: Start difference. First operand 195 states and 281 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:50:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:47,806 INFO L93 Difference]: Finished difference Result 430 states and 620 transitions. [2024-11-19 00:50:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:50:47,807 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:50:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:47,811 INFO L225 Difference]: With dead ends: 430 [2024-11-19 00:50:47,811 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 00:50:47,812 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:50:47,813 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:47,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 604 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:50:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 00:50:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2024-11-19 00:50:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.3712574850299402) internal successors, (229), 168 states have internal predecessors, (229), 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:50:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 279 transitions. [2024-11-19 00:50:47,838 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 279 transitions. Word has length 180 [2024-11-19 00:50:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:47,838 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 279 transitions. [2024-11-19 00:50:47,839 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:50:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 279 transitions. [2024-11-19 00:50:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:47,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:47,842 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:50:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:50:47,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1213410666, now seen corresponding path program 1 times [2024-11-19 00:50:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143778419] [2024-11-19 00:50:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:48,387 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:50:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143778419] [2024-11-19 00:50:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143778419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:50:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675592862] [2024-11-19 00:50:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:50:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:50:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:50:48,390 INFO L87 Difference]: Start difference. First operand 195 states and 279 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:50:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:48,710 INFO L93 Difference]: Finished difference Result 693 states and 988 transitions. [2024-11-19 00:50:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:50:48,711 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:50:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:48,714 INFO L225 Difference]: With dead ends: 693 [2024-11-19 00:50:48,714 INFO L226 Difference]: Without dead ends: 501 [2024-11-19 00:50:48,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:50:48,715 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 301 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:48,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1239 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:50:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-19 00:50:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2024-11-19 00:50:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 427 states have (on average 1.3676814988290398) internal successors, (584), 432 states have internal predecessors, (584), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-19 00:50:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 706 transitions. [2024-11-19 00:50:48,746 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 706 transitions. Word has length 180 [2024-11-19 00:50:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:48,746 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 706 transitions. [2024-11-19 00:50:48,746 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:50:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 706 transitions. [2024-11-19 00:50:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:48,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:48,748 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:50:48,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:50:48,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:48,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2060488276, now seen corresponding path program 1 times [2024-11-19 00:50:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:48,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078265326] [2024-11-19 00:50:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:50,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:50:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078265326] [2024-11-19 00:50:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078265326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:50:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138655871] [2024-11-19 00:50:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:50,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:50:50,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:50:50,077 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:50:50,085 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:50:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:50,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:50:50,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:50:50,352 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:50:50,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:50:50,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:50:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138655871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:50:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-11-19 00:50:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254965188] [2024-11-19 00:50:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:50,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:50:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:50:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:50:50,527 INFO L87 Difference]: Start difference. First operand 495 states and 706 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:50:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:50,701 INFO L93 Difference]: Finished difference Result 1237 states and 1765 transitions. [2024-11-19 00:50:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:50:50,702 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:50:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:50,706 INFO L225 Difference]: With dead ends: 1237 [2024-11-19 00:50:50,707 INFO L226 Difference]: Without dead ends: 745 [2024-11-19 00:50:50,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:50:50,713 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:50:50,714 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:50:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-19 00:50:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 521. [2024-11-19 00:50:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 448 states have (on average 1.3504464285714286) internal successors, (605), 453 states have internal predecessors, (605), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-19 00:50:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 735 transitions. [2024-11-19 00:50:50,760 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 735 transitions. Word has length 180 [2024-11-19 00:50:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:50,761 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 735 transitions. [2024-11-19 00:50:50,761 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:50:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 735 transitions. [2024-11-19 00:50:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:50,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:50,763 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:50:50,781 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:50:50,963 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:50:50,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:50,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -395762216, now seen corresponding path program 1 times [2024-11-19 00:50:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:50,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087148576] [2024-11-19 00:50:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:51,934 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:50:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087148576] [2024-11-19 00:50:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087148576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:50:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637889103] [2024-11-19 00:50:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:51,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:50:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:50:51,939 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:50:51,948 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:50:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:52,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:50:52,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:50:52,136 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:50:52,186 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 17 treesize of output 13 [2024-11-19 00:50:52,215 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 21 treesize of output 13 [2024-11-19 00:50:52,239 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 19 treesize of output 11 [2024-11-19 00:50:52,281 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:50:52,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:50:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637889103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:50:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-19 00:50:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266748175] [2024-11-19 00:50:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:52,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:50:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:50:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:50:52,283 INFO L87 Difference]: Start difference. First operand 521 states and 735 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:50:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:52,687 INFO L93 Difference]: Finished difference Result 1123 states and 1583 transitions. [2024-11-19 00:50:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:50:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:50:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:52,690 INFO L225 Difference]: With dead ends: 1123 [2024-11-19 00:50:52,690 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 00:50:52,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:50:52,694 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 319 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:52,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1646 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:50:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 00:50:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2024-11-19 00:50:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 511 states have (on average 1.3444227005870841) internal successors, (687), 517 states have internal predecessors, (687), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 845 transitions. [2024-11-19 00:50:52,738 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 845 transitions. Word has length 180 [2024-11-19 00:50:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 845 transitions. [2024-11-19 00:50:52,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:50:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 845 transitions. [2024-11-19 00:50:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:52,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:52,741 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:50:52,760 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:50:52,945 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:50:52,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:52,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1416830570, now seen corresponding path program 1 times [2024-11-19 00:50:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204151582] [2024-11-19 00:50:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:53,282 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:50:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:53,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204151582] [2024-11-19 00:50:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204151582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:53,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:50:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871603866] [2024-11-19 00:50:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:53,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:50:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:50:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:50:53,284 INFO L87 Difference]: Start difference. First operand 599 states and 845 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:50:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:53,626 INFO L93 Difference]: Finished difference Result 1195 states and 1683 transitions. [2024-11-19 00:50:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:50:53,626 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:50:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:53,629 INFO L225 Difference]: With dead ends: 1195 [2024-11-19 00:50:53,629 INFO L226 Difference]: Without dead ends: 599 [2024-11-19 00:50:53,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:50:53,630 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 221 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:53,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1675 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:50:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-19 00:50:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2024-11-19 00:50:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 505 states have (on average 1.3405940594059407) internal successors, (677), 511 states have internal predecessors, (677), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 835 transitions. [2024-11-19 00:50:53,662 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 835 transitions. Word has length 180 [2024-11-19 00:50:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:53,663 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 835 transitions. [2024-11-19 00:50:53,663 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:50:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 835 transitions. [2024-11-19 00:50:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:53,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:53,664 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:50:53,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:50:53,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash 576235292, now seen corresponding path program 1 times [2024-11-19 00:50:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334905091] [2024-11-19 00:50:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:53,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:50:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334905091] [2024-11-19 00:50:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334905091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:50:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627407038] [2024-11-19 00:50:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:50:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:50:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:50:53,983 INFO L87 Difference]: Start difference. First operand 593 states and 835 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:50:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:54,208 INFO L93 Difference]: Finished difference Result 1360 states and 1921 transitions. [2024-11-19 00:50:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:50:54,208 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:50:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:54,211 INFO L225 Difference]: With dead ends: 1360 [2024-11-19 00:50:54,212 INFO L226 Difference]: Without dead ends: 770 [2024-11-19 00:50:54,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:50:54,213 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 124 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:54,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1301 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:50:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-19 00:50:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 599. [2024-11-19 00:50:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 511 states have (on average 1.340508806262231) internal successors, (685), 517 states have internal predecessors, (685), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 843 transitions. [2024-11-19 00:50:54,261 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 843 transitions. Word has length 180 [2024-11-19 00:50:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:54,262 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 843 transitions. [2024-11-19 00:50:54,262 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:50:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 843 transitions. [2024-11-19 00:50:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:54,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:54,264 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:50:54,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:50:54,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:54,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -444833062, now seen corresponding path program 1 times [2024-11-19 00:50:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:54,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542458123] [2024-11-19 00:50:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:54,910 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:50:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542458123] [2024-11-19 00:50:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542458123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:50:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314381968] [2024-11-19 00:50:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:50:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:50:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:50:54,913 INFO L87 Difference]: Start difference. First operand 599 states and 843 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:50:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:55,290 INFO L93 Difference]: Finished difference Result 1578 states and 2224 transitions. [2024-11-19 00:50:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:50:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:50:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:55,295 INFO L225 Difference]: With dead ends: 1578 [2024-11-19 00:50:55,295 INFO L226 Difference]: Without dead ends: 982 [2024-11-19 00:50:55,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:50:55,297 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 369 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:55,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 676 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:50:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-19 00:50:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 649. [2024-11-19 00:50:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 561 states have (on average 1.3547237076648841) internal successors, (760), 567 states have internal predecessors, (760), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 918 transitions. [2024-11-19 00:50:55,351 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 918 transitions. Word has length 180 [2024-11-19 00:50:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:55,352 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 918 transitions. [2024-11-19 00:50:55,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:50:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 918 transitions. [2024-11-19 00:50:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:55,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:55,354 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:50:55,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:50:55,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash 898125811, now seen corresponding path program 1 times [2024-11-19 00:50:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736900828] [2024-11-19 00:50:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:55,538 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:50:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736900828] [2024-11-19 00:50:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736900828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:55,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:55,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:50:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114479128] [2024-11-19 00:50:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:50:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:55,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:50:55,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:50:55,539 INFO L87 Difference]: Start difference. First operand 649 states and 918 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:50:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:55,669 INFO L93 Difference]: Finished difference Result 1334 states and 1888 transitions. [2024-11-19 00:50:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:50:55,670 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:50:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:55,672 INFO L225 Difference]: With dead ends: 1334 [2024-11-19 00:50:55,672 INFO L226 Difference]: Without dead ends: 688 [2024-11-19 00:50:55,673 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:50:55,674 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 63 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:55,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 641 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:50:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-19 00:50:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 647. [2024-11-19 00:50:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 559 states have (on average 1.3470483005366727) internal successors, (753), 565 states have internal predecessors, (753), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2024-11-19 00:50:55,732 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 180 [2024-11-19 00:50:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2024-11-19 00:50:55,733 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:50:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2024-11-19 00:50:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 00:50:55,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:55,734 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:50:55,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:50:55,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:55,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 256766812, now seen corresponding path program 1 times [2024-11-19 00:50:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873052151] [2024-11-19 00:50:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:55,805 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:50:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873052151] [2024-11-19 00:50:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873052151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:50:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429809069] [2024-11-19 00:50:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:55,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:50:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:50:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:50:55,807 INFO L87 Difference]: Start difference. First operand 647 states and 911 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:50:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:55,850 INFO L93 Difference]: Finished difference Result 1271 states and 1789 transitions. [2024-11-19 00:50:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:50:55,850 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:50:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:55,853 INFO L225 Difference]: With dead ends: 1271 [2024-11-19 00:50:55,855 INFO L226 Difference]: Without dead ends: 627 [2024-11-19 00:50:55,856 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:50:55,856 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:50:55,857 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:50:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-19 00:50:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2024-11-19 00:50:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 539 states have (on average 1.3376623376623376) internal successors, (721), 545 states have internal predecessors, (721), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 879 transitions. [2024-11-19 00:50:55,889 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 879 transitions. Word has length 180 [2024-11-19 00:50:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:55,890 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 879 transitions. [2024-11-19 00:50:55,890 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:50:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 879 transitions. [2024-11-19 00:50:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:50:55,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:55,892 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:50:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:50:55,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1900634344, now seen corresponding path program 1 times [2024-11-19 00:50:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94509661] [2024-11-19 00:50:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:55,985 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:50:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94509661] [2024-11-19 00:50:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94509661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:50:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094439893] [2024-11-19 00:50:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:50:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:50:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:50:55,987 INFO L87 Difference]: Start difference. First operand 627 states and 879 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:50:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:56,030 INFO L93 Difference]: Finished difference Result 1257 states and 1763 transitions. [2024-11-19 00:50:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:50:56,030 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:50:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:56,033 INFO L225 Difference]: With dead ends: 1257 [2024-11-19 00:50:56,033 INFO L226 Difference]: Without dead ends: 633 [2024-11-19 00:50:56,034 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:50:56,034 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:50:56,034 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:50:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-19 00:50:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2024-11-19 00:50:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 545 states have (on average 1.3339449541284403) internal successors, (727), 551 states have internal predecessors, (727), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 885 transitions. [2024-11-19 00:50:56,064 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 885 transitions. Word has length 181 [2024-11-19 00:50:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:56,064 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 885 transitions. [2024-11-19 00:50:56,065 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:50:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 885 transitions. [2024-11-19 00:50:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:50:56,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:56,066 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:50:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:50:56,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:56,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1973020902, now seen corresponding path program 1 times [2024-11-19 00:50:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302484804] [2024-11-19 00:50:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:56,715 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:50:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302484804] [2024-11-19 00:50:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302484804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:50:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448623750] [2024-11-19 00:50:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:56,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:50:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:50:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:50:56,720 INFO L87 Difference]: Start difference. First operand 633 states and 885 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:57,015 INFO L93 Difference]: Finished difference Result 1302 states and 1822 transitions. [2024-11-19 00:50:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:50:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:57,018 INFO L225 Difference]: With dead ends: 1302 [2024-11-19 00:50:57,018 INFO L226 Difference]: Without dead ends: 672 [2024-11-19 00:50:57,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:50:57,020 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 439 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:57,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 598 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:50:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-19 00:50:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 630. [2024-11-19 00:50:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 542 states have (on average 1.3339483394833949) internal successors, (723), 548 states have internal predecessors, (723), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 881 transitions. [2024-11-19 00:50:57,069 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 881 transitions. Word has length 181 [2024-11-19 00:50:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:57,069 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 881 transitions. [2024-11-19 00:50:57,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 881 transitions. [2024-11-19 00:50:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:50:57,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:57,071 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:50:57,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:50:57,071 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1654071006, now seen corresponding path program 1 times [2024-11-19 00:50:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561489793] [2024-11-19 00:50:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:57,585 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:50:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561489793] [2024-11-19 00:50:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561489793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:57,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:50:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059330799] [2024-11-19 00:50:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:50:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:57,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:50:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:50:57,587 INFO L87 Difference]: Start difference. First operand 630 states and 881 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:57,945 INFO L93 Difference]: Finished difference Result 1335 states and 1871 transitions. [2024-11-19 00:50:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:50:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:57,949 INFO L225 Difference]: With dead ends: 1335 [2024-11-19 00:50:57,952 INFO L226 Difference]: Without dead ends: 708 [2024-11-19 00:50:57,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:50:57,953 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 358 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:57,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 575 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:50:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-19 00:50:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 630. [2024-11-19 00:50:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 542 states have (on average 1.330258302583026) internal successors, (721), 548 states have internal predecessors, (721), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 879 transitions. [2024-11-19 00:50:58,033 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 879 transitions. Word has length 181 [2024-11-19 00:50:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:58,033 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 879 transitions. [2024-11-19 00:50:58,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:50:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 879 transitions. [2024-11-19 00:50:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 00:50:58,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:58,035 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:50:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:50:58,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 633002652, now seen corresponding path program 1 times [2024-11-19 00:50:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456405839] [2024-11-19 00:50:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:58,499 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:50:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456405839] [2024-11-19 00:50:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456405839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:58,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:58,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:50:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896574496] [2024-11-19 00:50:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:50:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:50:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:50:58,501 INFO L87 Difference]: Start difference. First operand 630 states and 879 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:50:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:58,683 INFO L93 Difference]: Finished difference Result 1414 states and 1980 transitions. [2024-11-19 00:50:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:50:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:50:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:58,687 INFO L225 Difference]: With dead ends: 1414 [2024-11-19 00:50:58,687 INFO L226 Difference]: Without dead ends: 787 [2024-11-19 00:50:58,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:50:58,688 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 115 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:58,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1520 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:50:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-19 00:50:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 622. [2024-11-19 00:50:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 534 states have (on average 1.3314606741573034) internal successors, (711), 540 states have internal predecessors, (711), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 869 transitions. [2024-11-19 00:50:58,719 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 869 transitions. Word has length 181 [2024-11-19 00:50:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:58,719 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 869 transitions. [2024-11-19 00:50:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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:50:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 869 transitions. [2024-11-19 00:50:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:50:58,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:58,721 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:50:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:50:58,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2112639665, now seen corresponding path program 1 times [2024-11-19 00:50:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321146350] [2024-11-19 00:50:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:58,777 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:50:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321146350] [2024-11-19 00:50:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321146350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:50:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951062713] [2024-11-19 00:50:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:50:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:50:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:50:58,779 INFO L87 Difference]: Start difference. First operand 622 states and 869 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:50:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:58,812 INFO L93 Difference]: Finished difference Result 1242 states and 1737 transitions. [2024-11-19 00:50:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:50:58,812 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:50:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:58,814 INFO L225 Difference]: With dead ends: 1242 [2024-11-19 00:50:58,814 INFO L226 Difference]: Without dead ends: 623 [2024-11-19 00:50:58,815 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:50:58,816 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:50:58,816 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:50:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-19 00:50:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-19 00:50:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 535 states have (on average 1.330841121495327) internal successors, (712), 541 states have internal predecessors, (712), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 870 transitions. [2024-11-19 00:50:58,844 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 870 transitions. Word has length 182 [2024-11-19 00:50:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:58,844 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 870 transitions. [2024-11-19 00:50:58,844 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:50:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 870 transitions. [2024-11-19 00:50:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:50:58,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:58,846 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:50:58,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:50:58,846 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1083280367, now seen corresponding path program 1 times [2024-11-19 00:50:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954893355] [2024-11-19 00:50:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:58,977 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:50:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954893355] [2024-11-19 00:50:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954893355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:50:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718330603] [2024-11-19 00:50:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:50:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:50:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:50:58,979 INFO L87 Difference]: Start difference. First operand 623 states and 870 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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:50:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:59,064 INFO L93 Difference]: Finished difference Result 1244 states and 1738 transitions. [2024-11-19 00:50:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:50:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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:50:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:59,067 INFO L225 Difference]: With dead ends: 1244 [2024-11-19 00:50:59,067 INFO L226 Difference]: Without dead ends: 624 [2024-11-19 00:50:59,068 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:50:59,068 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 4 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:59,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 676 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:50:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-19 00:50:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 623. [2024-11-19 00:50:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 535 states have (on average 1.3289719626168224) internal successors, (711), 541 states have internal predecessors, (711), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:50:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 869 transitions. [2024-11-19 00:50:59,097 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 869 transitions. Word has length 182 [2024-11-19 00:50:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:59,097 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 869 transitions. [2024-11-19 00:50:59,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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:50:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 869 transitions. [2024-11-19 00:50:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 00:50:59,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:59,099 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:50:59,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:50:59,099 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:59,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 688913581, now seen corresponding path program 1 times [2024-11-19 00:50:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433268241] [2024-11-19 00:50:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:59,218 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:50:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:59,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433268241] [2024-11-19 00:50:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433268241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:50:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245225293] [2024-11-19 00:50:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:59,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:50:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:50:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:50:59,220 INFO L87 Difference]: Start difference. First operand 623 states and 869 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:50:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:59,282 INFO L93 Difference]: Finished difference Result 1083 states and 1510 transitions. [2024-11-19 00:50:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:50:59,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:50:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:59,286 INFO L225 Difference]: With dead ends: 1083 [2024-11-19 00:50:59,286 INFO L226 Difference]: Without dead ends: 463 [2024-11-19 00:50:59,287 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:50:59,287 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 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:50:59,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:50:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-19 00:50:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2024-11-19 00:50:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 382 states have internal predecessors, (488), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:50:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 642 transitions. [2024-11-19 00:50:59,326 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 642 transitions. Word has length 182 [2024-11-19 00:50:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:59,326 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 642 transitions. [2024-11-19 00:50:59,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:50:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 642 transitions. [2024-11-19 00:50:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-19 00:50:59,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:59,328 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:50:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:50:59,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -621272487, now seen corresponding path program 1 times [2024-11-19 00:50:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402188889] [2024-11-19 00:50:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:50:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:50:59,693 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:50:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:50:59,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402188889] [2024-11-19 00:50:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402188889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:50:59,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:50:59,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:50:59,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278142158] [2024-11-19 00:50:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:50:59,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:50:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:50:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:50:59,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:50:59,696 INFO L87 Difference]: Start difference. First operand 462 states and 642 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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:50:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:50:59,935 INFO L93 Difference]: Finished difference Result 900 states and 1247 transitions. [2024-11-19 00:50:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:50:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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:50:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:50:59,938 INFO L225 Difference]: With dead ends: 900 [2024-11-19 00:50:59,938 INFO L226 Difference]: Without dead ends: 478 [2024-11-19 00:50:59,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:50:59,940 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 144 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:50:59,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1452 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:50:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-19 00:50:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 477. [2024-11-19 00:50:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 392 states have (on average 1.2831632653061225) internal successors, (503), 397 states have internal predecessors, (503), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:50:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 657 transitions. [2024-11-19 00:50:59,985 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 657 transitions. Word has length 183 [2024-11-19 00:50:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:50:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 657 transitions. [2024-11-19 00:50:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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:50:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 657 transitions. [2024-11-19 00:50:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:50:59,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:50:59,988 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:50:59,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:50:59,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:50:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:50:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash -67911810, now seen corresponding path program 1 times [2024-11-19 00:50:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:50:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277000980] [2024-11-19 00:50:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:50:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:00,100 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:51:00,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:00,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277000980] [2024-11-19 00:51:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277000980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:00,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:00,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:51:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878287895] [2024-11-19 00:51:00,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:00,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:51:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:00,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:51:00,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:51:00,105 INFO L87 Difference]: Start difference. First operand 477 states and 657 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:51:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:00,163 INFO L93 Difference]: Finished difference Result 919 states and 1266 transitions. [2024-11-19 00:51:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:51:00,164 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:51:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:00,166 INFO L225 Difference]: With dead ends: 919 [2024-11-19 00:51:00,166 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 00:51:00,171 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:51:00,171 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:51:00,172 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:51:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 00:51:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2024-11-19 00:51:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 397 states have (on average 1.279596977329975) internal successors, (508), 402 states have internal predecessors, (508), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 662 transitions. [2024-11-19 00:51:00,227 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 662 transitions. Word has length 185 [2024-11-19 00:51:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 662 transitions. [2024-11-19 00:51:00,231 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:51:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 662 transitions. [2024-11-19 00:51:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:51:00,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:00,232 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:51:00,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:51:00,232 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:00,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1656259712, now seen corresponding path program 1 times [2024-11-19 00:51:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466133213] [2024-11-19 00:51:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:00,392 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:51:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466133213] [2024-11-19 00:51:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466133213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:00,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118875896] [2024-11-19 00:51:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:00,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:00,395 INFO L87 Difference]: Start difference. First operand 482 states and 662 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:51:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:00,532 INFO L93 Difference]: Finished difference Result 1219 states and 1673 transitions. [2024-11-19 00:51:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:00,532 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:51:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:00,536 INFO L225 Difference]: With dead ends: 1219 [2024-11-19 00:51:00,536 INFO L226 Difference]: Without dead ends: 777 [2024-11-19 00:51:00,537 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:51:00,537 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:51:00,538 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:51:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-19 00:51:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 482. [2024-11-19 00:51:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 397 states have (on average 1.2670025188916876) internal successors, (503), 402 states have internal predecessors, (503), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 657 transitions. [2024-11-19 00:51:00,569 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 657 transitions. Word has length 185 [2024-11-19 00:51:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:00,570 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 657 transitions. [2024-11-19 00:51:00,570 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:51:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 657 transitions. [2024-11-19 00:51:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-19 00:51:00,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:00,571 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:51:00,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:51:00,571 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1358843906, now seen corresponding path program 1 times [2024-11-19 00:51:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:00,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409768648] [2024-11-19 00:51:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:00,724 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:51:00,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409768648] [2024-11-19 00:51:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409768648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396957448] [2024-11-19 00:51:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:00,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:00,727 INFO L87 Difference]: Start difference. First operand 482 states and 657 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:51:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:00,779 INFO L93 Difference]: Finished difference Result 899 states and 1226 transitions. [2024-11-19 00:51:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:00,779 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:51:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:00,781 INFO L225 Difference]: With dead ends: 899 [2024-11-19 00:51:00,782 INFO L226 Difference]: Without dead ends: 457 [2024-11-19 00:51:00,782 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:51:00,783 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:51:00,783 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:51:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-19 00:51:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2024-11-19 00:51:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 367 states have (on average 1.2615803814713897) internal successors, (463), 372 states have internal predecessors, (463), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 617 transitions. [2024-11-19 00:51:00,831 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 617 transitions. Word has length 185 [2024-11-19 00:51:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 617 transitions. [2024-11-19 00:51:00,831 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:51:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 617 transitions. [2024-11-19 00:51:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 00:51:00,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:00,832 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:51:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:51:00,832 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:00,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash -730884783, now seen corresponding path program 1 times [2024-11-19 00:51:00,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865052809] [2024-11-19 00:51:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:01,696 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:51:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865052809] [2024-11-19 00:51:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865052809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:01,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:01,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:51:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118019421] [2024-11-19 00:51:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:51:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:51:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:01,699 INFO L87 Difference]: Start difference. First operand 452 states and 617 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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:51:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:02,168 INFO L93 Difference]: Finished difference Result 1007 states and 1366 transitions. [2024-11-19 00:51:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:51:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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:51:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:02,172 INFO L225 Difference]: With dead ends: 1007 [2024-11-19 00:51:02,172 INFO L226 Difference]: Without dead ends: 595 [2024-11-19 00:51:02,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:02,174 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 358 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:02,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1149 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-19 00:51:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 518. [2024-11-19 00:51:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 433 states have (on average 1.251732101616628) internal successors, (542), 438 states have internal predecessors, (542), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 696 transitions. [2024-11-19 00:51:02,218 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 696 transitions. Word has length 187 [2024-11-19 00:51:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:02,219 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 696 transitions. [2024-11-19 00:51:02,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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:51:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 696 transitions. [2024-11-19 00:51:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 00:51:02,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:02,220 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:51:02,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:51:02,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:02,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash -472719345, now seen corresponding path program 1 times [2024-11-19 00:51:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:02,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339837084] [2024-11-19 00:51:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:02,315 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:51:02,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339837084] [2024-11-19 00:51:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339837084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:02,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654185516] [2024-11-19 00:51:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:02,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:02,318 INFO L87 Difference]: Start difference. First operand 518 states and 696 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:51:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:02,372 INFO L93 Difference]: Finished difference Result 1015 states and 1361 transitions. [2024-11-19 00:51:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:02,373 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:51:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:02,377 INFO L225 Difference]: With dead ends: 1015 [2024-11-19 00:51:02,377 INFO L226 Difference]: Without dead ends: 537 [2024-11-19 00:51:02,378 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:51:02,380 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:51:02,380 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:51:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-19 00:51:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2024-11-19 00:51:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 449 states have (on average 1.242761692650334) internal successors, (558), 454 states have internal predecessors, (558), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 712 transitions. [2024-11-19 00:51:02,426 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 712 transitions. Word has length 187 [2024-11-19 00:51:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:02,426 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 712 transitions. [2024-11-19 00:51:02,426 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:51:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 712 transitions. [2024-11-19 00:51:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-19 00:51:02,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:02,428 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:51:02,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:51:02,428 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:02,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1725337417, now seen corresponding path program 1 times [2024-11-19 00:51:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303944469] [2024-11-19 00:51:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:02,874 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:51:02,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303944469] [2024-11-19 00:51:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303944469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:02,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:02,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200402959] [2024-11-19 00:51:02,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:02,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:02,876 INFO L87 Difference]: Start difference. First operand 534 states and 712 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:51:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:03,289 INFO L93 Difference]: Finished difference Result 1235 states and 1630 transitions. [2024-11-19 00:51:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:03,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 188 [2024-11-19 00:51:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:03,293 INFO L225 Difference]: With dead ends: 1235 [2024-11-19 00:51:03,293 INFO L226 Difference]: Without dead ends: 741 [2024-11-19 00:51:03,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:03,295 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 285 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:03,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 675 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:51:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-19 00:51:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 567. [2024-11-19 00:51:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 482 states have (on average 1.2365145228215768) internal successors, (596), 487 states have internal predecessors, (596), 77 states have call successors, (77), 7 states have call predecessors, (77), 7 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-19 00:51:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 750 transitions. [2024-11-19 00:51:03,340 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 750 transitions. Word has length 188 [2024-11-19 00:51:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 750 transitions. [2024-11-19 00:51:03,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:51:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 750 transitions. [2024-11-19 00:51:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:03,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:03,343 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:51:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:51:03,343 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2086549611, now seen corresponding path program 1 times [2024-11-19 00:51:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935378826] [2024-11-19 00:51:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:04,933 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:51:04,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:04,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935378826] [2024-11-19 00:51:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935378826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:04,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:51:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960802647] [2024-11-19 00:51:04,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:51:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:04,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:51:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:04,936 INFO L87 Difference]: Start difference. First operand 567 states and 750 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:05,607 INFO L93 Difference]: Finished difference Result 1145 states and 1507 transitions. [2024-11-19 00:51:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:05,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2024-11-19 00:51:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:05,611 INFO L225 Difference]: With dead ends: 1145 [2024-11-19 00:51:05,611 INFO L226 Difference]: Without dead ends: 618 [2024-11-19 00:51:05,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:05,613 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 383 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:05,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 806 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-19 00:51:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-11-19 00:51:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 525 states have (on average 1.24) internal successors, (651), 531 states have internal predecessors, (651), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:51:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 809 transitions. [2024-11-19 00:51:05,661 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 809 transitions. Word has length 189 [2024-11-19 00:51:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:05,662 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 809 transitions. [2024-11-19 00:51:05,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 809 transitions. [2024-11-19 00:51:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:05,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:05,663 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:51:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:51:05,664 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 267792035, now seen corresponding path program 1 times [2024-11-19 00:51:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353838933] [2024-11-19 00:51:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:07,557 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:51:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:07,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353838933] [2024-11-19 00:51:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353838933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:07,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99172378] [2024-11-19 00:51:07,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:07,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:07,559 INFO L87 Difference]: Start difference. First operand 614 states and 809 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:08,589 INFO L93 Difference]: Finished difference Result 1321 states and 1738 transitions. [2024-11-19 00:51:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:51:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2024-11-19 00:51:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:08,594 INFO L225 Difference]: With dead ends: 1321 [2024-11-19 00:51:08,594 INFO L226 Difference]: Without dead ends: 751 [2024-11-19 00:51:08,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:51:08,596 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 324 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:08,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 962 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:51:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-19 00:51:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 617. [2024-11-19 00:51:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 528 states have (on average 1.240530303030303) internal successors, (655), 534 states have internal predecessors, (655), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:51:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 813 transitions. [2024-11-19 00:51:08,652 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 813 transitions. Word has length 189 [2024-11-19 00:51:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 813 transitions. [2024-11-19 00:51:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 813 transitions. [2024-11-19 00:51:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:08,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:08,654 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:51:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 00:51:08,655 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1475606685, now seen corresponding path program 1 times [2024-11-19 00:51:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148980303] [2024-11-19 00:51:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:10,405 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:51:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148980303] [2024-11-19 00:51:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148980303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388872599] [2024-11-19 00:51:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:10,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:10,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:10,408 INFO L87 Difference]: Start difference. First operand 617 states and 813 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:10,982 INFO L93 Difference]: Finished difference Result 1349 states and 1771 transitions. [2024-11-19 00:51:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 189 [2024-11-19 00:51:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:10,987 INFO L225 Difference]: With dead ends: 1349 [2024-11-19 00:51:10,987 INFO L226 Difference]: Without dead ends: 776 [2024-11-19 00:51:10,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:10,988 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 301 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:10,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 678 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-19 00:51:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 621. [2024-11-19 00:51:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 532 states have (on average 1.2349624060150375) internal successors, (657), 538 states have internal predecessors, (657), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:51:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 815 transitions. [2024-11-19 00:51:11,046 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 815 transitions. Word has length 189 [2024-11-19 00:51:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:11,046 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 815 transitions. [2024-11-19 00:51:11,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 815 transitions. [2024-11-19 00:51:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:11,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:11,048 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:51:11,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:51:11,048 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1831826601, now seen corresponding path program 1 times [2024-11-19 00:51:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71467528] [2024-11-19 00:51:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:11,165 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:51:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71467528] [2024-11-19 00:51:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71467528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720826420] [2024-11-19 00:51:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:11,167 INFO L87 Difference]: Start difference. First operand 621 states and 815 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:51:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:11,241 INFO L93 Difference]: Finished difference Result 1228 states and 1608 transitions. [2024-11-19 00:51:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:11,242 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:51:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:11,245 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 00:51:11,246 INFO L226 Difference]: Without dead ends: 651 [2024-11-19 00:51:11,247 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:51:11,248 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:51:11,248 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:51:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-19 00:51:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 638. [2024-11-19 00:51:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 549 states have (on average 1.2276867030965393) internal successors, (674), 555 states have internal predecessors, (674), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:51:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 832 transitions. [2024-11-19 00:51:11,306 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 832 transitions. Word has length 189 [2024-11-19 00:51:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 832 transitions. [2024-11-19 00:51:11,307 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:51:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 832 transitions. [2024-11-19 00:51:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:11,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:11,308 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:51:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:51:11,309 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 551962923, now seen corresponding path program 1 times [2024-11-19 00:51:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488112007] [2024-11-19 00:51:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:11,756 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:51:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488112007] [2024-11-19 00:51:11,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488112007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:51:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052727791] [2024-11-19 00:51:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:11,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:51:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:51:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:11,758 INFO L87 Difference]: Start difference. First operand 638 states and 832 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:51:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:12,273 INFO L93 Difference]: Finished difference Result 1364 states and 1768 transitions. [2024-11-19 00:51:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:12,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2024-11-19 00:51:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:12,282 INFO L225 Difference]: With dead ends: 1364 [2024-11-19 00:51:12,286 INFO L226 Difference]: Without dead ends: 770 [2024-11-19 00:51:12,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:12,288 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 477 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:12,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 707 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-19 00:51:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 638. [2024-11-19 00:51:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 549 states have (on average 1.2240437158469946) internal successors, (672), 555 states have internal predecessors, (672), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-19 00:51:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 830 transitions. [2024-11-19 00:51:12,405 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 830 transitions. Word has length 189 [2024-11-19 00:51:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:12,408 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 830 transitions. [2024-11-19 00:51:12,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:51:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 830 transitions. [2024-11-19 00:51:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 00:51:12,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:12,410 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:51:12,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 00:51:12,414 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 777621859, now seen corresponding path program 1 times [2024-11-19 00:51:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548415945] [2024-11-19 00:51:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:13,780 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:51:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:13,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548415945] [2024-11-19 00:51:13,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548415945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:13,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:51:13,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594017094] [2024-11-19 00:51:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:13,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:51:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:51:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:13,782 INFO L87 Difference]: Start difference. First operand 638 states and 830 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:14,283 INFO L93 Difference]: Finished difference Result 1293 states and 1667 transitions. [2024-11-19 00:51:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 189 [2024-11-19 00:51:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:14,286 INFO L225 Difference]: With dead ends: 1293 [2024-11-19 00:51:14,286 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 00:51:14,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:14,288 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 579 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:14,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 666 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 00:51:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 497. [2024-11-19 00:51:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 414 states have (on average 1.1956521739130435) internal successors, (495), 417 states have internal predecessors, (495), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:51:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 641 transitions. [2024-11-19 00:51:14,325 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 641 transitions. Word has length 189 [2024-11-19 00:51:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 641 transitions. [2024-11-19 00:51:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 641 transitions. [2024-11-19 00:51:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:14,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:14,327 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:51:14,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:51:14,327 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:14,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 346704995, now seen corresponding path program 1 times [2024-11-19 00:51:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:14,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645363386] [2024-11-19 00:51:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:15,754 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:51:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645363386] [2024-11-19 00:51:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645363386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:15,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:15,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203392915] [2024-11-19 00:51:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:15,756 INFO L87 Difference]: Start difference. First operand 497 states and 641 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:16,379 INFO L93 Difference]: Finished difference Result 1142 states and 1459 transitions. [2024-11-19 00:51:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:16,379 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), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 190 [2024-11-19 00:51:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:16,382 INFO L225 Difference]: With dead ends: 1142 [2024-11-19 00:51:16,382 INFO L226 Difference]: Without dead ends: 689 [2024-11-19 00:51:16,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:16,383 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 241 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:16,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 874 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-19 00:51:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 684. [2024-11-19 00:51:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 583 states have (on average 1.2041166380789021) internal successors, (702), 589 states have internal predecessors, (702), 85 states have call successors, (85), 15 states have call predecessors, (85), 15 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:51:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 872 transitions. [2024-11-19 00:51:16,442 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 872 transitions. Word has length 190 [2024-11-19 00:51:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 872 transitions. [2024-11-19 00:51:16,442 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), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 872 transitions. [2024-11-19 00:51:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:16,444 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:51:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 00:51:16,444 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 594851489, now seen corresponding path program 1 times [2024-11-19 00:51:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756298380] [2024-11-19 00:51:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:17,565 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:51:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756298380] [2024-11-19 00:51:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756298380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 00:51:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004096043] [2024-11-19 00:51:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:17,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:51:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:51:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:17,567 INFO L87 Difference]: Start difference. First operand 684 states and 872 transitions. Second operand has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:18,413 INFO L93 Difference]: Finished difference Result 1470 states and 1867 transitions. [2024-11-19 00:51:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:51:18,413 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 190 [2024-11-19 00:51:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:18,417 INFO L225 Difference]: With dead ends: 1470 [2024-11-19 00:51:18,417 INFO L226 Difference]: Without dead ends: 830 [2024-11-19 00:51:18,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:51:18,418 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 677 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:18,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1252 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:51:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-19 00:51:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 813. [2024-11-19 00:51:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 688 states have (on average 1.2078488372093024) internal successors, (831), 697 states have internal predecessors, (831), 103 states have call successors, (103), 21 states have call predecessors, (103), 21 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1037 transitions. [2024-11-19 00:51:18,505 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1037 transitions. Word has length 190 [2024-11-19 00:51:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:18,505 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1037 transitions. [2024-11-19 00:51:18,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1037 transitions. [2024-11-19 00:51:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:18,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:18,506 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:51:18,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 00:51:18,507 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:18,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash -228817437, now seen corresponding path program 1 times [2024-11-19 00:51:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236133731] [2024-11-19 00:51:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:19,557 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:51:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236133731] [2024-11-19 00:51:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236133731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312050303] [2024-11-19 00:51:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:19,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:19,559 INFO L87 Difference]: Start difference. First operand 813 states and 1037 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:20,079 INFO L93 Difference]: Finished difference Result 1705 states and 2164 transitions. [2024-11-19 00:51:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:20,079 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), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 190 [2024-11-19 00:51:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:20,083 INFO L225 Difference]: With dead ends: 1705 [2024-11-19 00:51:20,083 INFO L226 Difference]: Without dead ends: 936 [2024-11-19 00:51:20,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:20,085 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 573 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:20,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 695 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:51:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-19 00:51:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 820. [2024-11-19 00:51:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 691 states have (on average 1.1982633863965269) internal successors, (828), 700 states have internal predecessors, (828), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1034 transitions. [2024-11-19 00:51:20,178 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1034 transitions. Word has length 190 [2024-11-19 00:51:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:20,179 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1034 transitions. [2024-11-19 00:51:20,179 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), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1034 transitions. [2024-11-19 00:51:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:20,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:20,180 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:51:20,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 00:51:20,181 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1508681115, now seen corresponding path program 1 times [2024-11-19 00:51:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804040709] [2024-11-19 00:51:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:21,262 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:51:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804040709] [2024-11-19 00:51:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804040709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:51:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860732559] [2024-11-19 00:51:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:21,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:51:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:51:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:21,264 INFO L87 Difference]: Start difference. First operand 820 states and 1034 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:22,047 INFO L93 Difference]: Finished difference Result 1736 states and 2182 transitions. [2024-11-19 00:51:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:51:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 190 [2024-11-19 00:51:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:22,051 INFO L225 Difference]: With dead ends: 1736 [2024-11-19 00:51:22,051 INFO L226 Difference]: Without dead ends: 964 [2024-11-19 00:51:22,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:51:22,053 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 564 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:22,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1076 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-19 00:51:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 824. [2024-11-19 00:51:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 694 states have (on average 1.1930835734870318) internal successors, (828), 703 states have internal predecessors, (828), 103 states have call successors, (103), 26 states have call predecessors, (103), 26 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1034 transitions. [2024-11-19 00:51:22,163 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1034 transitions. Word has length 190 [2024-11-19 00:51:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:22,164 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1034 transitions. [2024-11-19 00:51:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1034 transitions. [2024-11-19 00:51:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:22,165 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:51:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 00:51:22,165 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1250515677, now seen corresponding path program 1 times [2024-11-19 00:51:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347703627] [2024-11-19 00:51:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:23,914 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:51:23,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:23,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347703627] [2024-11-19 00:51:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347703627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:51:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000802511] [2024-11-19 00:51:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:23,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:51:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:23,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:51:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:23,916 INFO L87 Difference]: Start difference. First operand 824 states and 1034 transitions. Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:24,964 INFO L93 Difference]: Finished difference Result 1704 states and 2145 transitions. [2024-11-19 00:51:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:51:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 190 [2024-11-19 00:51:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:24,971 INFO L225 Difference]: With dead ends: 1704 [2024-11-19 00:51:24,971 INFO L226 Difference]: Without dead ends: 932 [2024-11-19 00:51:24,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:51:24,973 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 579 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:24,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1533 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:51:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-19 00:51:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 837. [2024-11-19 00:51:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 707 states have (on average 1.190947666195191) internal successors, (842), 716 states have internal predecessors, (842), 103 states have call successors, (103), 26 states have call predecessors, (103), 26 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1048 transitions. [2024-11-19 00:51:25,148 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1048 transitions. Word has length 190 [2024-11-19 00:51:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:25,149 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1048 transitions. [2024-11-19 00:51:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1048 transitions. [2024-11-19 00:51:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 00:51:25,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:25,150 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:51:25,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 00:51:25,151 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1619440157, now seen corresponding path program 1 times [2024-11-19 00:51:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284161600] [2024-11-19 00:51:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:27,060 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:51:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284161600] [2024-11-19 00:51:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284161600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 00:51:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167754338] [2024-11-19 00:51:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:27,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:51:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:51:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:27,062 INFO L87 Difference]: Start difference. First operand 837 states and 1048 transitions. Second operand has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:27,957 INFO L93 Difference]: Finished difference Result 1646 states and 2061 transitions. [2024-11-19 00:51:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:51:27,958 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 190 [2024-11-19 00:51:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:27,961 INFO L225 Difference]: With dead ends: 1646 [2024-11-19 00:51:27,961 INFO L226 Difference]: Without dead ends: 861 [2024-11-19 00:51:27,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:51:27,962 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 604 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:27,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1108 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-19 00:51:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 821. [2024-11-19 00:51:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 691 states have (on average 1.1924746743849493) internal successors, (824), 700 states have internal predecessors, (824), 103 states have call successors, (103), 26 states have call predecessors, (103), 26 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1030 transitions. [2024-11-19 00:51:28,063 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1030 transitions. Word has length 190 [2024-11-19 00:51:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:28,063 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1030 transitions. [2024-11-19 00:51:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1030 transitions. [2024-11-19 00:51:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:28,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:28,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, 1] [2024-11-19 00:51:28,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 00:51:28,065 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:28,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -196934681, now seen corresponding path program 1 times [2024-11-19 00:51:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:28,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882529380] [2024-11-19 00:51:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:28,150 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:51:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882529380] [2024-11-19 00:51:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882529380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292727169] [2024-11-19 00:51:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:28,152 INFO L87 Difference]: Start difference. First operand 821 states and 1030 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:51:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:28,256 INFO L93 Difference]: Finished difference Result 1617 states and 2029 transitions. [2024-11-19 00:51:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:28,257 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:51:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:28,260 INFO L225 Difference]: With dead ends: 1617 [2024-11-19 00:51:28,260 INFO L226 Difference]: Without dead ends: 848 [2024-11-19 00:51:28,261 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:51:28,261 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:51:28,262 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:51:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-19 00:51:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 839. [2024-11-19 00:51:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 709 states have (on average 1.1875881523272214) internal successors, (842), 718 states have internal predecessors, (842), 103 states have call successors, (103), 26 states have call predecessors, (103), 26 states have return successors, (103), 94 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-19 00:51:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1048 transitions. [2024-11-19 00:51:28,360 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1048 transitions. Word has length 191 [2024-11-19 00:51:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1048 transitions. [2024-11-19 00:51:28,361 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:51:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1048 transitions. [2024-11-19 00:51:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:28,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:28,362 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:51:28,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 00:51:28,362 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -589961691, now seen corresponding path program 1 times [2024-11-19 00:51:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250177166] [2024-11-19 00:51:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:29,183 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:51:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250177166] [2024-11-19 00:51:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250177166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128057136] [2024-11-19 00:51:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:29,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:29,184 INFO L87 Difference]: Start difference. First operand 839 states and 1048 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:29,829 INFO L93 Difference]: Finished difference Result 2317 states and 2883 transitions. [2024-11-19 00:51:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:29,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 191 [2024-11-19 00:51:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:29,834 INFO L225 Difference]: With dead ends: 2317 [2024-11-19 00:51:29,835 INFO L226 Difference]: Without dead ends: 1530 [2024-11-19 00:51:29,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:29,836 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 388 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:29,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 564 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-19 00:51:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1525. [2024-11-19 00:51:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1314 states have (on average 1.1894977168949772) internal successors, (1563), 1332 states have internal predecessors, (1563), 163 states have call successors, (163), 47 states have call predecessors, (163), 47 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2024-11-19 00:51:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1889 transitions. [2024-11-19 00:51:30,035 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1889 transitions. Word has length 191 [2024-11-19 00:51:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:30,035 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1889 transitions. [2024-11-19 00:51:30,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1889 transitions. [2024-11-19 00:51:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:30,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:30,037 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:51:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 00:51:30,037 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash -455100119, now seen corresponding path program 1 times [2024-11-19 00:51:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374992894] [2024-11-19 00:51:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:31,482 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:51:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:31,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374992894] [2024-11-19 00:51:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374992894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:31,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 00:51:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919955550] [2024-11-19 00:51:31,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:31,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 00:51:31,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 00:51:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:51:31,483 INFO L87 Difference]: Start difference. First operand 1525 states and 1889 transitions. Second operand has 18 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:33,019 INFO L93 Difference]: Finished difference Result 4180 states and 5229 transitions. [2024-11-19 00:51:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:51:33,019 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 191 [2024-11-19 00:51:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:33,029 INFO L225 Difference]: With dead ends: 4180 [2024-11-19 00:51:33,029 INFO L226 Difference]: Without dead ends: 2707 [2024-11-19 00:51:33,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:51:33,032 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 760 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:33,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1152 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:51:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2024-11-19 00:51:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2205. [2024-11-19 00:51:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1994 states have (on average 1.1745235707121364) internal successors, (2342), 2012 states have internal predecessors, (2342), 163 states have call successors, (163), 47 states have call predecessors, (163), 47 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2024-11-19 00:51:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2668 transitions. [2024-11-19 00:51:33,400 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2668 transitions. Word has length 191 [2024-11-19 00:51:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 2668 transitions. [2024-11-19 00:51:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2668 transitions. [2024-11-19 00:51:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:33,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:33,404 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:51:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 00:51:33,404 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:33,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1484459417, now seen corresponding path program 1 times [2024-11-19 00:51:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180405888] [2024-11-19 00:51:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:34,568 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:51:34,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180405888] [2024-11-19 00:51:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180405888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:34,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:34,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 00:51:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852514813] [2024-11-19 00:51:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:51:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:51:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:51:34,570 INFO L87 Difference]: Start difference. First operand 2205 states and 2668 transitions. Second operand has 17 states, 15 states have (on average 5.266666666666667) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:36,048 INFO L93 Difference]: Finished difference Result 5097 states and 6156 transitions. [2024-11-19 00:51:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:51:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.266666666666667) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 191 [2024-11-19 00:51:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:36,057 INFO L225 Difference]: With dead ends: 5097 [2024-11-19 00:51:36,058 INFO L226 Difference]: Without dead ends: 2944 [2024-11-19 00:51:36,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:51:36,061 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 698 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:36,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1133 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:51:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2024-11-19 00:51:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2903. [2024-11-19 00:51:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2601 states have (on average 1.1718569780853518) internal successors, (3048), 2628 states have internal predecessors, (3048), 229 states have call successors, (229), 72 states have call predecessors, (229), 72 states have return successors, (229), 202 states have call predecessors, (229), 229 states have call successors, (229) [2024-11-19 00:51:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3506 transitions. [2024-11-19 00:51:36,846 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3506 transitions. Word has length 191 [2024-11-19 00:51:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:36,847 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 3506 transitions. [2024-11-19 00:51:36,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.266666666666667) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:51:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3506 transitions. [2024-11-19 00:51:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:36,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:36,851 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:51:36,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 00:51:36,851 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1877486427, now seen corresponding path program 1 times [2024-11-19 00:51:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147449333] [2024-11-19 00:51:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:37,402 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:51:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147449333] [2024-11-19 00:51:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147449333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714139827] [2024-11-19 00:51:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:37,404 INFO L87 Difference]: Start difference. First operand 2903 states and 3506 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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:51:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:38,197 INFO L93 Difference]: Finished difference Result 6276 states and 7595 transitions. [2024-11-19 00:51:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:51:38,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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:51:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:38,205 INFO L225 Difference]: With dead ends: 6276 [2024-11-19 00:51:38,205 INFO L226 Difference]: Without dead ends: 3429 [2024-11-19 00:51:38,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:38,209 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 210 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:38,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1126 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:51:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2024-11-19 00:51:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3211. [2024-11-19 00:51:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 2909 states have (on average 1.1698178068064626) internal successors, (3403), 2936 states have internal predecessors, (3403), 229 states have call successors, (229), 72 states have call predecessors, (229), 72 states have return successors, (229), 202 states have call predecessors, (229), 229 states have call successors, (229) [2024-11-19 00:51:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 3861 transitions. [2024-11-19 00:51:38,619 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 3861 transitions. Word has length 191 [2024-11-19 00:51:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:38,621 INFO L471 AbstractCegarLoop]: Abstraction has 3211 states and 3861 transitions. [2024-11-19 00:51:38,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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:51:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 3861 transitions. [2024-11-19 00:51:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 00:51:38,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:38,625 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:51:38,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-19 00:51:38,625 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:38,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1438700581, now seen corresponding path program 1 times [2024-11-19 00:51:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:38,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882034724] [2024-11-19 00:51:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:39,457 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:51:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882034724] [2024-11-19 00:51:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882034724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:51:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285379774] [2024-11-19 00:51:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:51:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:51:39,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:39,459 INFO L87 Difference]: Start difference. First operand 3211 states and 3861 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:40,479 INFO L93 Difference]: Finished difference Result 6333 states and 7587 transitions. [2024-11-19 00:51:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 191 [2024-11-19 00:51:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:40,486 INFO L225 Difference]: With dead ends: 6333 [2024-11-19 00:51:40,486 INFO L226 Difference]: Without dead ends: 3178 [2024-11-19 00:51:40,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:40,490 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 574 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:40,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 689 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-11-19 00:51:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2502. [2024-11-19 00:51:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2277 states have (on average 1.1515151515151516) internal successors, (2622), 2295 states have internal predecessors, (2622), 169 states have call successors, (169), 55 states have call predecessors, (169), 55 states have return successors, (169), 151 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-19 00:51:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2960 transitions. [2024-11-19 00:51:40,795 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 2960 transitions. Word has length 191 [2024-11-19 00:51:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:40,795 INFO L471 AbstractCegarLoop]: Abstraction has 2502 states and 2960 transitions. [2024-11-19 00:51:40,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2960 transitions. [2024-11-19 00:51:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 00:51:40,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:40,798 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:51:40,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-19 00:51:40,799 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1633060821, now seen corresponding path program 1 times [2024-11-19 00:51:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956671562] [2024-11-19 00:51:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:43,019 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:51:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956671562] [2024-11-19 00:51:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956671562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:43,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:51:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15515649] [2024-11-19 00:51:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:51:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:51:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:43,021 INFO L87 Difference]: Start difference. First operand 2502 states and 2960 transitions. Second operand has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:44,730 INFO L93 Difference]: Finished difference Result 5595 states and 6614 transitions. [2024-11-19 00:51:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:51:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 192 [2024-11-19 00:51:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:44,739 INFO L225 Difference]: With dead ends: 5595 [2024-11-19 00:51:44,739 INFO L226 Difference]: Without dead ends: 3153 [2024-11-19 00:51:44,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:51:44,743 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 370 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:44,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1840 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:51:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-11-19 00:51:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2468. [2024-11-19 00:51:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2243 states have (on average 1.1484618814088274) internal successors, (2576), 2261 states have internal predecessors, (2576), 169 states have call successors, (169), 55 states have call predecessors, (169), 55 states have return successors, (169), 151 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-19 00:51:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 2914 transitions. [2024-11-19 00:51:45,146 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 2914 transitions. Word has length 192 [2024-11-19 00:51:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 2468 states and 2914 transitions. [2024-11-19 00:51:45,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-19 00:51:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2914 transitions. [2024-11-19 00:51:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:51:45,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:45,149 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:51:45,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-19 00:51:45,149 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:45,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1417294, now seen corresponding path program 1 times [2024-11-19 00:51:45,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:45,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181494222] [2024-11-19 00:51:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:46,534 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:51:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181494222] [2024-11-19 00:51:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181494222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:46,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 00:51:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508315832] [2024-11-19 00:51:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:46,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:51:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:51:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:51:46,536 INFO L87 Difference]: Start difference. First operand 2468 states and 2914 transitions. Second operand has 17 states, 15 states have (on average 5.4) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:47,844 INFO L93 Difference]: Finished difference Result 6031 states and 7194 transitions. [2024-11-19 00:51:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:51:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.4) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 193 [2024-11-19 00:51:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:47,853 INFO L225 Difference]: With dead ends: 6031 [2024-11-19 00:51:47,853 INFO L226 Difference]: Without dead ends: 3623 [2024-11-19 00:51:47,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:51:47,857 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 615 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:47,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1294 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:51:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2024-11-19 00:51:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2468. [2024-11-19 00:51:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2243 states have (on average 1.1484618814088274) internal successors, (2576), 2261 states have internal predecessors, (2576), 169 states have call successors, (169), 55 states have call predecessors, (169), 55 states have return successors, (169), 151 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-19 00:51:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 2914 transitions. [2024-11-19 00:51:48,229 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 2914 transitions. Word has length 193 [2024-11-19 00:51:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:48,230 INFO L471 AbstractCegarLoop]: Abstraction has 2468 states and 2914 transitions. [2024-11-19 00:51:48,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.4) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-19 00:51:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2914 transitions. [2024-11-19 00:51:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:51:48,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:48,235 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:51:48,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-19 00:51:48,237 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -391609716, now seen corresponding path program 1 times [2024-11-19 00:51:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572326365] [2024-11-19 00:51:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:48,963 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:51:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572326365] [2024-11-19 00:51:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572326365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658926328] [2024-11-19 00:51:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:48,965 INFO L87 Difference]: Start difference. First operand 2468 states and 2914 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:51:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:49,889 INFO L93 Difference]: Finished difference Result 5339 states and 6301 transitions. [2024-11-19 00:51:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2024-11-19 00:51:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:49,895 INFO L225 Difference]: With dead ends: 5339 [2024-11-19 00:51:49,896 INFO L226 Difference]: Without dead ends: 2931 [2024-11-19 00:51:49,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:49,900 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 566 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:49,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 718 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2024-11-19 00:51:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2178. [2024-11-19 00:51:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1953 states have (on average 1.1459293394777266) internal successors, (2238), 1971 states have internal predecessors, (2238), 169 states have call successors, (169), 55 states have call predecessors, (169), 55 states have return successors, (169), 151 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-19 00:51:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 2576 transitions. [2024-11-19 00:51:50,381 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 2576 transitions. Word has length 193 [2024-11-19 00:51:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:50,381 INFO L471 AbstractCegarLoop]: Abstraction has 2178 states and 2576 transitions. [2024-11-19 00:51:50,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:51:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2576 transitions. [2024-11-19 00:51:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 00:51:50,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:50,386 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:51:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-19 00:51:50,386 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1819775333, now seen corresponding path program 1 times [2024-11-19 00:51:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265447105] [2024-11-19 00:51:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:51,350 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:51:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265447105] [2024-11-19 00:51:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265447105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119280248] [2024-11-19 00:51:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:51,354 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:51:51,355 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:51:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:51,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 00:51:51,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:52,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:51:53,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 00:51:54,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 00:51:55,403 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 44 treesize of output 30 [2024-11-19 00:51:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:51:55,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2024-11-19 00:51:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:51:55,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:51:55,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-19 00:51:55,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:51:55,822 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2024-11-19 00:51:55,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 70 [2024-11-19 00:51:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 123 proven. 537 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-19 00:51:55,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:51:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119280248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:56,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:51:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2024-11-19 00:51:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475451745] [2024-11-19 00:51:56,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:51:56,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 00:51:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:56,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 00:51:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:51:56,240 INFO L87 Difference]: Start difference. First operand 2178 states and 2576 transitions. Second operand has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 8 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-19 00:51:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:58,784 INFO L93 Difference]: Finished difference Result 3909 states and 4589 transitions. [2024-11-19 00:51:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 00:51:58,785 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 8 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (46), 6 states have call predecessors, (46), 8 states have call successors, (46) Word has length 193 [2024-11-19 00:51:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:58,790 INFO L225 Difference]: With dead ends: 3909 [2024-11-19 00:51:58,790 INFO L226 Difference]: Without dead ends: 1791 [2024-11-19 00:51:58,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=1937, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 00:51:58,793 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 329 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:58,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 985 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:51:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states.